{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:41:51Z","timestamp":1725522111694},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540922476"},{"type":"electronic","value":"9783540922483"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92248-3_5","type":"book-chapter","created":{"date-parts":[[2008,12,4]],"date-time":"2008-12-04T13:36:17Z","timestamp":1228397777000},"page":"43-54","source":"Crossref","is-referenced-by-count":0,"title":["Approximating the Metric TSP in Linear Time"],"prefix":"10.1007","author":[{"given":"Davide","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"Luca","family":"Forlizzi","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"5_CR1","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM\u00a045(5), 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0020-0190(00)00089-2","volume":"75","author":"H.-J. B\u00f6ckenhauer","year":"2000","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Klasing, R., Seibert, S., Unger, W.: Approximation algorithms for the TSP with sharpened triangle inequality. Information Processing Letters\u00a075, 133\u2013138 (2000)","journal-title":"Information Processing Letters"},{"issue":"3","key":"5_CR3","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1287\/moor.23.3.613","volume":"23","author":"R.E. Burkard","year":"1998","unstructured":"Burkard, R.E., Deineko, V.G., Woeginger, G.J.: The travelling salesman and the pq-tree. Mathematics of Operations Research\u00a023(3), 613\u2013623 (1998)","journal-title":"Mathematics of Operations Research"},{"key":"5_CR4","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report, Graduate School of Industrial Administration, Carnegy\u2013Mellon University (1976)"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-72845-0_11","volume-title":"Experimental Algorithms","author":"V.G. Deineko","year":"2007","unstructured":"Deineko, V.G., Tiskin, A.: Fast minimum-weight double-tree shortcutting for metric TSP. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol.\u00a04525, pp. 136\u2013149. Springer, Heidelberg (2007)"},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1077464.1077472","volume":"1","author":"D.E. Drake Vinkemeier","year":"2005","unstructured":"Drake Vinkemeier, D.E., Hougardy, S.: A linear-time approximation algorithm for weighted matchings in graphs. ACM Transactions on Algorithms\u00a01(1), 107\u2013122 (2005)","journal-title":"ACM Transactions on Algorithms"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Gabow, H.N.: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In: Proc. of the 15th Annual ACM Symp. on Theory of Computing (STOC), pp. 448\u2013456 (1983)","DOI":"10.1145\/800061.808776"},{"issue":"4","key":"5_CR8","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1145\/115234.115366","volume":"38","author":"H.N. Gabow","year":"1991","unstructured":"Gabow, H.N., Tarjan, R.E.: Faster scaling algorithms for general graph-matching problems. J. ACM\u00a038(4), 815\u2013853 (1991)","journal-title":"J. ACM"},{"issue":"1","key":"5_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s00493-006-0008-z","volume":"26","author":"C.H. Papadimitriou","year":"2006","unstructured":"Papadimitriou, C.H., Vempala, S.: On the approximability of the traveling salesman problem. Combinatorica\u00a026(1), 101\u2013120 (2006)","journal-title":"Combinatorica"},{"key":"5_CR10","unstructured":"Reinelt, G.: TSPLIB library, University of Heidelberg, \n                    \n                      http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/tsplib95\/"},{"issue":"2-3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0166-218X(03)00451-7","volume":"136","author":"X. Tan","year":"2004","unstructured":"Tan, X.: Approximation algorithms for the watchman route and zookeeper\u2019s problems. Discrete Applied Mathematics\u00a0136(2-3), 363\u2013376 (2004)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92248-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T07:47:26Z","timestamp":1551685646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92248-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540922476","9783540922483"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92248-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}