{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T14:45:55Z","timestamp":1648565155642},"reference-count":11,"publisher":"Elsevier BV","issue":"1-4","license":[{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"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 Sciences"],"published-print":{"date-parts":[[1999,3]]},"DOI":"10.1016\/s0020-0255(98)10058-0","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T01:23:41Z","timestamp":1051233821000},"page":"105-126","source":"Crossref","is-referenced-by-count":3,"title":["Three-quarter approximation for the number of unused colors in graph coloring"],"prefix":"10.1016","volume":"114","author":[{"given":"Wen-Guey","family":"Tzeng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gow-Hsing","family":"King","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0255(98)10058-0_bib1","series-title":"Proc. of The 33rd IEEE Symp. on Foundations of Computer Science","article-title":"Approximating clique is NP-Complete","author":"Arora","year":"1992"},{"key":"10.1016\/S0020-0255(98)10058-0_bib2","series-title":"Proc. of The 31st IEEE Symp. on Foundations of Computer Science","first-page":"554","article-title":"Some tools for approximate 3-coloring","author":"Blum","year":"1990"},{"key":"10.1016\/S0020-0255(98)10058-0_bib3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0020-0190(94)90039-6","article-title":"Approximation results for the minimum graph coloring problem","volume":"50","author":"Demange","year":"1994","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0020-0255(98)10058-0_bib4","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0255(98)10058-0_bib5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-Complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0255(98)10058-0_bib6","series-title":"Algorithmic Graph Theory","author":"Gibbons","year":"1985"},{"key":"10.1016\/S0020-0255(98)10058-0_bib7","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0020-0190(94)00113-8","article-title":"Maximizing the number of unused colors in the vertex coloring problem","volume":"52","author":"Hassin","year":"1994","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0020-0255(98)10058-0_bib8","series-title":"Algorithmica","first-page":"511","article-title":"The general matching algorithm of Micali and Vazirani","author":"Peterson","year":"1988"},{"key":"10.1016\/S0020-0255(98)10058-0_bib9","series-title":"Proc. 25th Annual ACM Symp. Theory of Computing","first-page":"286","article-title":"On the hardness of approximating minimization problems","author":"Lund","year":"1993"},{"key":"10.1016\/S0020-0255(98)10058-0_bib10","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1145\/2157.2158","article-title":"Improving the performance guarantee for approximate graph coloring","volume":"30","author":"Widgerson","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0255(98)10058-0_bib11","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":"Wong","year":"1978","journal-title":"Commun. ACM"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025598100580?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025598100580?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T10:26:32Z","timestamp":1556274392000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025598100580"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":11,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["S0020025598100580"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(98)10058-0","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1999,3]]}}}