{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:22Z","timestamp":1759638262741},"reference-count":26,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"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":[[2002,6]]},"DOI":"10.1016\/s0020-0190(01)00287-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:03:54Z","timestamp":1027605834000},"page":"229-235","source":"Crossref","is-referenced-by-count":24,"title":["Differential approximation results for the traveling salesman and related problems"],"prefix":"10.1016","volume":"82","author":[{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00287-3_BIB001","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(94)00291-P","article-title":"Approximate solutions of NP-optimization problems","volume":"150","author":"Ausiello","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(01)00287-3_BIB002","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."},{"key":"10.1016\/S0020-0190(01)00287-3_BIB003","series-title":"Approximation of optimization problems and total function of NP, Ph.D. Thesis","author":"Bazgan","year":"1998"},{"key":"10.1016\/S0020-0190(01)00287-3_BIB004","first-page":"201","article-title":"On covering the points of a graph with point disjoint paths","volume":"406","author":"Boesch","year":"1974"},{"key":"10.1016\/S0020-0190(01)00287-3_BIB005","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1145\/322003.322005","article-title":"On covering the point of a digraph with point-disjoint paths and its application to code optimization","volume":"24","author":"Boesch","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(01)00287-3_BIB006","series-title":"Worst-case analysis of a new heuristic for the traveling salesman problem, Technical Report 338","author":"Christofides","year":"1976"},{"key":"10.1016\/S0020-0190(01)00287-3_BIB007","author":"Crescenzi"},{"key":"10.1016\/S0020-0190(01)00287-3_BIB008","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0890-5401(91)90025-W","article-title":"Completeness in approximation classes","volume":"93","author":"Crescenzi","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0020-0190(01)00287-3_BIB009","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0304-3975(97)00099-6","article-title":"Differential approximation algorithms for some combinatorial optimization problems","volume":"209","author":"Demange","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(01)00287-3_BIB010","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0893-9659(99)00112-3","article-title":"Bridging gap between standard and differential polynomial approxiamtion: The case of bin-packing","volume":"12","author":"Demange","year":"1999","journal-title":"Appl. Math. Lett."},{"key":"10.1016\/S0020-0190(01)00287-3_BIB011","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":"156","author":"Demange","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(01)00287-3_BIB012","series-title":"Approximation hardness of TSP with bounded metrics, E.C.C.C. Report TR00-089","author":"Engebretsen","year":"2000"},{"issue":"4","key":"10.1016\/S0020-0190(01)00287-3_BIB013","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1287\/opre.27.4.799","article-title":"An analysis of approximations for finding a maximum weight hamiltonian circuit","volume":"27","author":"Fisher","year":"1979","journal-title":"Oper. Res."},{"key":"10.1016\/S0020-0190(01)00287-3_BIB014","series-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(01)00287-3_BIB015","series-title":"Extensions of matching theory, Ph.D. Thesis","author":"Hartvigsen","year":"1984"},{"key":"10.1016\/S0020-0190(01)00287-3_BIB016","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reductibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0020-0190(01)00287-3_BIB017","series-title":"Proc. FOCS'94","first-page":"166","article-title":"Long tours and short superstrings","author":"Kosaraju","year":"1994"},{"key":"10.1016\/S0020-0190(01)00287-3_BIB018","series-title":"Proc. FCT'01","article-title":"Differential approximation results for the traveling salesman problem with distances 1 and 2","author":"Monnot","year":"2001"},{"key":"10.1016\/S0020-0190(01)00287-3_BIB019","series-title":"On approximation preserving reductions: complete problems and robust measures, Tech. Report","author":"Orponen","year":"1987"},{"key":"10.1016\/S0020-0190(01)00287-3_BIB020","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.18.1.1","article-title":"The traveling salesman problem with distance one and two","volume":"18","author":"Papadimitriou","year":"1993","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0020-0190(01)00287-3_BIB021","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01408172","article-title":"On mapping processes to processors","volume":"16","author":"Pinter","year":"1987","journal-title":"Internat. J. Parallel Programming"},{"key":"10.1016\/S0020-0190(01)00287-3_BIB022","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","article-title":"P-complete approximation problems","volume":"23","author":"Sahni","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(01)00287-3_BIB023","first-page":"80","article-title":"An algorithm with an estimate for the traveling salesman problem of the maximum","volume":"25","author":"Serdyukov","year":"1984","journal-title":"Upravlyaemye Sistemy"},{"key":"10.1016\/S0020-0190(01)00287-3_BIB024","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0020-0190(92)90103-3","article-title":"An approximation algorithm for the asymmetric travelling salesman problem with distances one and two","volume":"44","author":"Vishwanathan","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(01)00287-3_BIB025","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1006\/jagm.2001.1187","article-title":"z-Approximations","volume":"41","author":"Hassin","year":"2001","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(01)00287-3_BIB026","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0020-0190(01)00234-4","article-title":"A 7\/8-approximation algorithm for metric Max TSP","volume":"81","author":"Hassin","year":"2002","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002873?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002873?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:52:56Z","timestamp":1556481176000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002873"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":26,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0020019001002873"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00287-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}