{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T15:52:15Z","timestamp":1649173935958},"reference-count":11,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2006,4]]},"DOI":"10.1051\/ro:2006014","type":"journal-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T06:02:26Z","timestamp":1160546546000},"page":"129-142","source":"Crossref","is-referenced-by-count":3,"title":["On-line models and algorithms for max independent set"],"prefix":"10.1051","volume":"40","author":[{"given":"Bruno","family":"Escoffier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2006,10,12]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1007\/s004530010071","volume":"29","author":"Ausiello","year":"2001","journal-title":"Algorithmica"},{"key":"R2","unstructured":"C. Berge,Graphs and hypergraphs. North Holland, Amsterdam (1973)."},{"key":"R3","unstructured":"M. Demange, X. Paradon and V.Th. Paschos, On-line maximum-order induced hereditary subgraph problems, inSOFSEM 2000\u2014Theory and Practice of Informatics, edited by V. Hlav\u00e1\u010d, K.G. Jeffery and J. Wiedermann. Springer-Verlag,Lect. Notes Comput. Sci.1963(2000) 326\u2013334."},{"key":"R4","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0893-9659(97)00044-X","volume":"10","author":"Demange","year":"1997","journal-title":"Appl. Math. Lett."},{"key":"R5","unstructured":"M. Demange, V.Th. Paschos, Improved approximations for weighted and unweighted graph problems.Theor. Comput. Syst.To appear."},{"key":"R6","unstructured":"B. Escoffier,Probl\u00e8meon-linedu stable de cardinalit\u00e9 maximale. M\u00e9moire de DEA (2002)."},{"key":"R7","unstructured":"M.M. Halld\u00f3rsson, Approximations via partitioning. JAIST Research Report IS-RR-95-0003F, Japan Advanced Institute of Science and Technology, Japan (1995)."},{"key":"R8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00020","volume":"4","author":"Halld\u00f3rsson","year":"2000","journal-title":"J. Graph Algorithms Appli."},{"key":"R9","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1016\/S0304-3975(01)00411-X","volume":"289","author":"Halld\u00f3rsson","year":"2002","journal-title":"Theoret. Comput. Sci."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"D.S. Hochbaum, editor,Approximation algorithms for NP-hard problems. PWS, Boston (1997).","DOI":"10.1145\/261342.571216"},{"key":"R11","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/254180.254190","volume":"29","author":"Paschos","year":"1997","journal-title":"ACM Comput. Surveys"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2006014\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T12:16:41Z","timestamp":1555849001000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2006014"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4]]},"references-count":11,"journal-issue":{"issue":"2"},"alternative-id":["ro0575"],"URL":"https:\/\/doi.org\/10.1051\/ro:2006014","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,4]]}}}