{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:54:50Z","timestamp":1725555290952},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130724"},{"type":"electronic","value":"9783642130731"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-13073-1_7","type":"book-chapter","created":{"date-parts":[[2010,5,10]],"date-time":"2010-05-10T04:09:58Z","timestamp":1273464598000},"page":"61-72","source":"Crossref","is-referenced-by-count":5,"title":["Improved Approximations for TSP with Simple Precedence Constraints"],"prefix":"10.1007","author":[{"given":"Hans-Joachim","family":"B\u00f6ckenhauer","sequence":"first","affiliation":[]},{"given":"Ralf","family":"Klasing","sequence":"additional","affiliation":[]},{"given":"Tobias","family":"M\u00f6mke","sequence":"additional","affiliation":[]},{"given":"Monika","family":"Steinov\u00e1","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"7_CR1","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.1024","volume":"38","author":"T. Andreae","year":"2001","unstructured":"Andreae, T.: On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality. Networks\u00a038(2), 59\u201367 (2001)","journal-title":"Networks"},{"issue":"1-3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0166-218X(94)90199-6","volume":"49","author":"H.J. Bandelt","year":"1994","unstructured":"Bandelt, H.J., Crama, Y., Spieksma, F.C.R.: Approximation algorithms for multi-dimensional assignment problems with decomposable costs. Discrete Appl. Math.\u00a049(1-3), 25\u201350 (1994)","journal-title":"Discrete Appl. Math."},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/11785293_19","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"H.-J. B\u00f6ckenhauer","year":"2006","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Kneis, J., Kupke, J.: On the approximation hardness of some generalizations of TSP (extended abstract). In: Arge, L., Freivalds, R.V. (eds.) SWAT 2006. LNCS, vol.\u00a04059, pp. 184\u2013195. Springer, Heidelberg (2006)"},{"key":"7_CR4","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Tech. Rep. 388, Graduate School of Industrial Administration, Carnegie-Mellon University (1976)"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"1076","DOI":"10.1137\/1.9781611973075.87","volume-title":"Proc.\u00a0of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u00a02010)","author":"D. Eppstein","year":"2010","unstructured":"Eppstein, D.: Paired approximation problems and incompatible inapproximabilities. In: Charikar, M. (ed.) Proc.\u00a0of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u00a02010), pp. 1076\u20131086. SIAM, New York (2010)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-39890-5_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M.R. Fellows","year":"2003","unstructured":"Fellows, M.R.: Blow-ups, win\/win\u2019s, and crown rules: Some new directions in FPT. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 1\u201312. Springer, Heidelberg (2003)"},{"volume-title":"The Traveling Salesman Problem and Its Variations. Combinatorial Optimization","year":"2007","key":"7_CR7","unstructured":"Gutin, G., Punnen, A.P. (eds.): The Traveling Salesman Problem and Its Variations. Combinatorial Optimization. Springer, New York (2007)"},{"issue":"4","key":"7_CR8","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/s004530010045","volume":"28","author":"N. Guttmann-Beck","year":"2000","unstructured":"Guttmann-Beck, N., Hassin, R., Khuller, S., Raghavachari, B.: Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem. Algorithmica\u00a028(4), 422\u2013437 (2000)","journal-title":"Algorithmica"},{"issue":"5","key":"7_CR9","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0167-6377(91)90016-I","volume":"10","author":"J.A. Hoogeveen","year":"1991","unstructured":"Hoogeveen, J.A.: Analysis of Christofides\u2019 heuristic: some paths are more difficult than cycles. Oper. Res. Lett.\u00a010(5), 291\u2013295 (1991)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"7_CR10","first-page":"555","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.F.: P-complete approximation problems. J.\u00a0ACM\u00a023(3), 555\u2013565 (1976)","journal-title":"J.\u00a0ACM"},{"key":"7_CR11","first-page":"1","volume-title":"Proc.\u00a0of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u00a02006)","author":"V. Vassilevska","year":"2006","unstructured":"Vassilevska, V., Williams, R., Woo, S.L.M.: Confronting hardness using a hybrid approach. In: Proc.\u00a0of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u00a02006), pp. 1\u201310. SIAM, New York (2006)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13073-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T21:36:27Z","timestamp":1552512987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13073-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130724","9783642130731"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13073-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}