{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:22:12Z","timestamp":1725488532117},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540401766"},{"type":"electronic","value":"9783540448495"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44849-7_31","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T10:26:17Z","timestamp":1186741577000},"page":"277-288","source":"Crossref","is-referenced-by-count":2,"title":["Differential Approximation for Some Routing Problems"],"prefix":"10.1007","author":[{"given":"Cristina","family":"Bazgan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Refael","family":"Hassin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/0022-0000(80)90046-X","volume":"21","author":"G. Ausiello","year":"1980","unstructured":"G. Ausiello, A. D\u2019Atri and M. Protasi, \u201cStructure preserving reductions among convex optimization problems,\u201d Journal of Computing and System Sciences\n                           21 (1980) 136\u2013153.","journal-title":"Journal of Computing and System Sciences"},{"key":"31_CR2","unstructured":"C. Bazgan, Approximation of optimization problems and total function of NP, Ph.D. Thesis (in French), Universit\u00e9 Paris Sud (1998)."},{"key":"31_CR3","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1145\/321832.321847","volume":"21","author":"M. Bellmore","year":"1974","unstructured":"M. Bellmore and S. Hong, \u201cTransformation of Multi-salesmen Problem to the Standard Traveling Salesman Problem,\u201d Journal of the Association for Computing Machinery\n                           21 (1974) 500\u2013504.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"31_CR4","volume-title":"Combinatorial Optimization","author":"W.J. Cook","year":"1998","unstructured":"W.J. Cook, W.H. Cunningham, W.R. Pulleyblank, and A. Schrijver Combinatorial Optimization John Wiley & Sons Inc New York 1998 (Chapter 5.5)."},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(95)00060-7","volume":"158","author":"M. Demange","year":"1996","unstructured":"M. Demange and V. Paschos, \u201cOn an approximation measure founded on the links between optimization and polynomial approximation theory,\u201d Theoretical Computer Science\n                           158 (1996) 117\u2013141.","journal-title":"Theoretical Computer Science"},{"key":"31_CR6","unstructured":"L. Engebretsen and M. Karpinski, \u201cApproximation hardness of TSP with bounded metrics,\u201d \n                    http:\/\/www.nada.kth.se\/~enge\/papers\/BoundedTSP.pdf"},{"key":"31_CR7","volume-title":"Computers andin tractability. A guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson, \u201cComputers andin tractability. A guide to the theory of NP-completeness,#x201D; Freeman, C.A. San Francisco (1979)."},{"key":"31_CR8","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/moor.10.4.527","volume":"10","author":"M. Haimovich","year":"1985","unstructured":"M. Haimovich and A. H. G. Rinnooy Kan, \u201cBounds and heuristics for capacitated routing problems,\u201d Mathematics of Operations Research\n                           10 (1985) 527\u2013542.","journal-title":"Mathematics of Operations Research"},{"key":"31_CR9","unstructured":"M. Haimovich, A. H. G. Rinnooy Kan and L. Stougie, \u201c Analysis of Heuristics for Vehicle Routing Problems,\u201d in Vehicle Routing Methods and Studies, Golden, Assad editors, Elsevier (1988) 47\u201361."},{"key":"31_CR10","unstructured":"D. Hartvigsen, Extensions of Matching Theory. Ph.D. Thesis, Carnegie-Mellon University (1984)."},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1006\/jagm.2001.1187","volume":"41","author":"R. Hassin","year":"2001","unstructured":"R. Hassin and S. Khuller, \u201cz-approximations,\u201d Journal of Algorithms\n                           41 (2001) 429\u2013442.","journal-title":"Journal of Algorithms"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"D. G. Kirkpatrick and P. Hell, \u201cOn the completeness of a generalized matching problem,\u201d Proc. of the 10th ACM Symposium on Theory and Computing (1978) 240\u2013245.","DOI":"10.1145\/800133.804353"},{"issue":"4","key":"31_CR13","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1287\/opre.40.4.790","volume":"40","author":"C.-L. Li","year":"1992","unstructured":"C-L. Li, D. Simchi-Levi and M. Desrochers, \u201cOn the distance constrained vehicle routing problem,\u201d Operations Research\n                           404(1992) 790\u2013799.","journal-title":"Operations Research"},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0020-0190(01)00287-3","volume":"82","author":"J. Monnot","year":"2002","unstructured":"J. Monnot, \u201cDifferential approximation results for the traveling salesman and related problems,\u201d Information Processing Letters\n                           82 (2002) 229\u2013235.","journal-title":"Information Processing Letters"},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"J. Monnot, V. Th. Paschos and S. Toulouse, \u201c Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2,\u201d Proc. FCT (2001) 275\u2013286.","DOI":"10.1007\/3-540-44669-9_27"},{"issue":"1","key":"31_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.18.1.1","volume":"18","author":"C. Papadimitriou","year":"1993","unstructured":"C. Papadimitriou and M. Yannakakis, \u201cThe traveling salesman problem with distances one and two,\u201d Mathematics of Operations Research 18(1) (1993) 1\u201311.","journal-title":"Mathematics of Operations Research"},{"key":"31_CR17","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"S. Sahni and T. Gonzalez, \u201cP-complete approximation problems\u201d Journal of the Association for Computing Machinery\n                           23 (1976) 555\u2013565.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"31_CR18","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1287\/moor.6.3.319","volume":"6","author":"E. Zemel","year":"1981","unstructured":"E. Zemel, \u201cMeasuring the quality of approximate solution to zero-one programming problems,\u201d Mathematical Operations Research 6(1981) 319\u2013332.","journal-title":"Mathematical Operations Research"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44849-7_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T06:48:15Z","timestamp":1550731695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44849-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540401766","9783540448495"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44849-7_31","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}