{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T20:02:27Z","timestamp":1648929747852},"reference-count":9,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1051\/ro:2008020","type":"journal-article","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T10:19:02Z","timestamp":1219141142000},"page":"315-324","source":"Crossref","is-referenced-by-count":2,"title":["A note on the hardness results for the labeled perfect matching problems in bipartite graphs"],"prefix":"10.1051","volume":"42","author":[{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2008,8,20]]},"reference":[{"key":"R1","unstructured":"P. Alimonti and V. Kann, Hardness of approximating problems on cubic graphs, inProc. CIAC'97,Lect. Notes Comput. Sci.1203(1997) 288\u2013298."},{"key":"R2","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s00493-003-0025-0","volume":"23","author":"Arora","year":"2003","journal-title":"Combinatorica"},{"key":"R3","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0012-365X(96)00115-X","volume":"169","author":"Cameron","year":"1997","journal-title":"Discrete Math."},{"key":"R4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s00373-006-0686-8","volume":"23","author":"Costa","year":"2007","journal-title":"Graphs Comb."},{"key":"R5","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1145\/322092.322100","volume":"25","author":"Itai","year":"1978","journal-title":"J. ACM"},{"key":"R6","unstructured":"J. Monnot, On Complexity and Approximability of the Labeled Maximum\/Perfect Matching Problems, inProc. ISAAC'05,Lect. Notes Comput. Sci.3827(2005) 934\u2013943."},{"key":"R7","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.ipl.2005.06.009","volume":"96","author":"Monnot","year":"2005","journal-title":"Inf. Proc. Lett."},{"key":"R8","unstructured":"A. Paz and S. Moran, Non deterministic polynomial optimisation problems and their approximation,Theor. Comput. Sci.95(1981) 251\u2013277."},{"key":"R9","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0166-218X(92)90165-7","volume":"39","author":"Richey","year":"1992","journal-title":"Discrete Appl. Math."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2008020\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T07:02:58Z","timestamp":1497769378000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2008020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":9,"journal-issue":{"issue":"3"},"alternative-id":["ro0715"],"URL":"https:\/\/doi.org\/10.1051\/ro:2008020","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7]]}}}