{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T09:18:51Z","timestamp":1737105531868,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679967"},{"type":"electronic","value":"9783540444367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44436-x_19","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T09:33:14Z","timestamp":1182159194000},"page":"184-193","source":"Crossref","is-referenced-by-count":6,"title":["Improved Approximations for Tour and Tree Covers"],"prefix":"10.1007","author":[{"given":"Jochen","family":"K\u00f6nemann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Goran","family":"Konjevod","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ojas","family":"Parekh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amitabh","family":"Sinha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,3]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0020-0190(93)90072-H","volume":"47","author":"E. M. Arkin","year":"1993","unstructured":"E. M. Arkin, M. M. Halld\u00f3rsson, and R. Hassin. Approximating the tree and tour covers of a graph. Information Processing Letters, 47:275\u2013282, 1993.","journal-title":"Information Processing Letters"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BF01581256","volume":"59","author":"D. Bienstock","year":"1993","unstructured":"D. Bienstock, M. X. Goemans, D. Simchi-Levi, and D. Williamson. A note on the prize collecting traveling salesman problem. Math. Programming, 59:413\u2013420, 1993.","journal-title":"Math. Programming"},{"key":"19_CR3","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/3-540-45253-2_13","volume-title":"Algorithms - ESA 2000","author":"Robert Carr","year":"2000","unstructured":"R. D. Carr, T. Fujito, G. Konjevod, and O. Parekh. A 2 1\/10-approximation algorithm for a generalization of the weighted edge-dominating set problem. In procof \u201dESA\u2019 00\u201d, 2000."},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"L. Fleischer. Approximating fractional multicommodity flow independent of the number of commodities. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 24\u201331, 1999.","DOI":"10.1109\/SFFCS.1999.814573"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"N. Garg and J. K\u00f6nemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, pages 300\u2013309, 1998.","DOI":"10.1109\/SFCS.1998.743463"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF01580607","volume":"60","author":"M. X. Goemans","year":"1993","unstructured":"M. X. Goemans and D. J. Bertsimas. Survivable networks, linear programming relaxations and the parsimonious property. Math. Programming, 60:145\u2013166, 1993.","journal-title":"Math. Programming"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer, 1988.","DOI":"10.1007\/978-3-642-97881-4"},{"key":"19_CR8","unstructured":"G. Robins and A. Zelikovsky. Improved Steiner tree approximation in graphs. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 770\u2013779, 2000."},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0020-0190(90)90028-V","volume":"35","author":"D. B. Shmoys","year":"1990","unstructured":"D. B. Shmoys and D. P. Williamson. Analyzing the Held-Karp TSP bound: a monotonicity property with application. Information Processing Letters, 35:281\u2013285, 1990.","journal-title":"Information Processing Letters"},{"key":"19_CR10","unstructured":"V. V. Vazirani and S. Rajagopalan. On the bidirected cut relaxation for the metric Steiner tree problem. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 742\u2013751, 1999."},{"key":"19_CR11","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BFb0120913","volume":"13","author":"L. A. Wolsey","year":"1980","unstructured":"L. A. Wolsey. Heuristic analysis, linear programming and branch and bound. Math. Programming Stud., 13:121\u2013134, 1980.","journal-title":"Math. Programming Stud."}],"container-title":["Lecture Notes in Computer Science","Approximation Algorithms for Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44436-X_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T08:32:10Z","timestamp":1737102730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44436-X_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679967","9783540444367"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44436-x_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}