{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T11:04:52Z","timestamp":1693134292394},"reference-count":3,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,4,1]],"date-time":"1994-04-01T00:00:00Z","timestamp":765158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1994,4]]},"DOI":"10.1016\/0020-0190(94)90039-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"19-23","source":"Crossref","is-referenced-by-count":13,"title":["Approximation results for the minimum graph coloring problem"],"prefix":"10.1016","volume":"50","author":[{"given":"Marc","family":"Demange","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Grisoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)90039-6_BIB1","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(94)90039-6_BIB2","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1145\/359340.359346","article-title":"Covering edges by cliques with regard to keyword conflicts and intersection graphs","volume":"21","author":"Kou","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(94)90039-6_BIB3","first-page":"286","article-title":"On the hardness of aprroximating minimization problems","author":"Lund","year":"1993","journal-title":"Proc. ACM\/STOC"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900396?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900396?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:50:14Z","timestamp":1555131014000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094900396"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,4]]},"references-count":3,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,4]]}},"alternative-id":["0020019094900396"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)90039-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,4]]}}}