{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:56:54Z","timestamp":1760245014476},"reference-count":20,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5342,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1016\/s0304-3975(97)00099-6","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"107-122","source":"Crossref","is-referenced-by-count":36,"title":["Differential approximation algorithms for some combinatorial optimization problems"],"prefix":"10.1016","volume":"209","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\/S0304-3975(97)00099-6_BIB1","series-title":"Proc. FOCS'92","first-page":"14","article-title":"Proof verification and intractability of approximation problems","author":"Arora","year":"1992"},{"key":"10.1016\/S0304-3975(97)00099-6_BIB2","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/0022-0000(80)90046-X","article-title":"Structure preserving reductions among convex optimization problems","volume":"21","author":"Ausiello","year":"1980","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/S0304-3975(97)00099-6_BIB3","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1145\/176584.176586","article-title":"New approximation algorithms for graph coloring","volume":"41","author":"Blum","year":"1994","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(97)00099-6_BIB4","first-page":"194","article-title":"On coloring the nodes of a network","volume":"37","author":"Brooks","year":"1941"},{"key":"10.1016\/S0304-3975(97)00099-6_BIB5","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","article-title":"A greedy \u2014 heuristic for the set covering problem","volume":"4","author":"Chv\u00e1tal","year":"1979","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0304-3975(97)00099-6_BIB6","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":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(97)00099-6_BIB7","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0304-3975(95)00060-7","article-title":"On an approximation measure founded on the links between optimization and polynomial approximation theory","volume":"158","author":"Demange","year":"1996","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/S0304-3975(97)00099-6_BIB8","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02579456","article-title":"Bin packing can be solved within 1 + \u03b5 in linear time","volume":"1","author":"de la Vega","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/S0304-3975(97)00099-6_BIB9","series-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(97)00099-6_BIB10","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0020-0190(93)90246-6","article-title":"A still better performance guarantee for approximate graph coloring","volume":"45","author":"Halld\u00f3rsson","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(97)00099-6_BIB11","series-title":"Proc. Symp. on Disc. Maths","first-page":"160","article-title":"Approximating discrete collections via local improvements","author":"Halld\u00f3rsson","year":"1995"},{"key":"10.1016\/S0304-3975(97)00099-6_BIB12","article-title":"Approximating set cover via local improvements","author":"Halld\u00f3rsson","year":"1995"},{"key":"10.1016\/S0304-3975(97)00099-6_BIB13","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":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(97)00099-6_BIB14","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"9","author":"Johnson","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00099-6_BIB15","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\/S0304-3975(97)00099-6_BIB16","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0095-8956(75)90089-1","article-title":"Three short proofs in graph theory","volume":"19","author":"Lov\u00e1sz","year":"1975","journal-title":"J. Comb. Theory B"},{"key":"10.1016\/S0304-3975(97)00099-6_BIB17","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","article-title":"On the ratio of optimal integral and fractional covers","volume":"13","author":"Lov\u00e1sz","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(97)00099-6_BIB18","series-title":"Proc. STOC'93","first-page":"286","article-title":"On the hardness of approximating minimization problems","author":"Lund","year":"1993"},{"issue":"2","key":"10.1016\/S0304-3975(97)00099-6_BIB19","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1137\/0403025","article-title":"On approximate solutions for combinatorial optimization problems","volume":"3","author":"Simon","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(97)00099-6_BIB20","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01581085","article-title":"Approximation algorithms for indefinite quadratic programming","volume":"57","author":"Vavasis","year":"1992","journal-title":"Math. Programming"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000996?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000996?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T09:02:49Z","timestamp":1555405369000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597000996"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["S0304397597000996"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00099-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}