{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:57:10Z","timestamp":1725555430887},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642124495"},{"type":"electronic","value":"9783642124501"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","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-12450-1_19","type":"book-chapter","created":{"date-parts":[[2010,5,5]],"date-time":"2010-05-05T19:01:49Z","timestamp":1273086109000},"page":"205-216","source":"Crossref","is-referenced-by-count":2,"title":["Multi-Criteria TSP: Min and Max Combined"],"prefix":"10.1007","author":[{"given":"Bodo","family":"Manthey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1\u20133","key":"19_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(03)00376-1","volume":"310","author":"E. Angel","year":"2004","unstructured":"Angel, E., Bampis, E., Gourv\u00e9s, L.: Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem. Theoret. Comput. Sci.\u00a0310(1\u20133), 135\u2013146 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/11537311_29","volume-title":"Fundamentals of Computation Theory","author":"E. Angel","year":"2005","unstructured":"Angel, E., Bampis, E., Gourv\u00e8s, L., Monnot, J.: (Non)-approximability for the multi-criteria TSP(1,2). In: Li\u015bkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol.\u00a03623, pp. 329\u2013340. Springer, Heidelberg (2005)"},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s00453-004-1131-0","volume":"42","author":"M. Bl\u00e4ser","year":"2005","unstructured":"Bl\u00e4ser, M., Manthey, B.: Approximating maximum weight cycle covers in directed graphs with weights zero and one. Algorithmica\u00a042(2), 121\u2013139 (2005)","journal-title":"Algorithmica"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-540-87744-8_16","volume-title":"Algorithms - ESA 2008","author":"M. Bl\u00e4ser","year":"2008","unstructured":"Bl\u00e4ser, M., Manthey, B., Putz, O.: Approximating multi-criteria max-TSP. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.\u00a05193, pp. 185\u2013197. Springer, Heidelberg (2008)"},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1111\/j.1475-3995.2000.tb00182.x","volume":"7","author":"M. Ehrgott","year":"2000","unstructured":"Ehrgott, M.: Approximation algorithms for combinatorial multicriteria optimization problems. Int. Trans. Oper. Res.\u00a07(1), 5\u201331 (2000)","journal-title":"Int. Trans. Oper. Res."},{"key":"19_CR6","volume-title":"Multicriteria Optimization","author":"M. Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer, Heidelberg (2005)"},{"issue":"4","key":"19_CR7","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s002910000046","volume":"22","author":"M. Ehrgott","year":"2000","unstructured":"Ehrgott, M., Gandibleux, X.: A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spectrum\u00a022(4), 425\u2013460 (2000)","journal-title":"OR Spectrum"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-540-74208-1_8","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"U. Feige","year":"2007","unstructured":"Feige, U., Singh, M.: Improved approximation ratios for traveling salesperson tours and paths in directed graphs. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol.\u00a04627, pp. 104\u2013118. Springer, Heidelberg (2007)"},{"issue":"4","key":"19_CR9","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1145\/1082036.1082041","volume":"52","author":"H. Kaplan","year":"2005","unstructured":"Kaplan, H., Lewenstein, M., Shafrir, N., Sviridenko, M.I.: Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. J. ACM\u00a052(4), 602\u2013626 (2005)","journal-title":"J. ACM"},{"key":"19_CR10","unstructured":"Manthey, B.: On approximating multi-criteria TSP. In: Proc. 26th Int. Symp. on Theoretical Aspects of Computer Science (STACS), pp. 637\u2013648 (2009)"},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s00453-007-9011-z","volume":"53","author":"B. Manthey","year":"2009","unstructured":"Manthey, B., Ram, L.S.: Approximation algorithms for multi-criteria traveling salesman problems. Algorithmica\u00a053(1), 69\u201388 (2009)","journal-title":"Algorithmica"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-642-03685-9_23","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"K. Paluch","year":"2009","unstructured":"Paluch, K., Mucha, M., Ma\u0327dry, A.: A 7\/9 - approximation algorithm for the maximum traveling salesman problem. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX 2009 and RANDOM 2009. LNCS, vol.\u00a05687, pp. 298\u2013311. Springer, Heidelberg (2009)"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1109\/SFCS.2000.892068","volume-title":"Proc. 41st Ann. IEEE Symp. on Foundations of Computer Science (FOCS)","author":"C.H. Papadimitriou","year":"2000","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: Proc. 41st Ann. IEEE Symp. on Foundations of Computer Science (FOCS), pp. 86\u201392. IEEE, Los Alamitos (2000)"},{"key":"19_CR14","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12450-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:37:37Z","timestamp":1558291057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12450-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642124495","9783642124501"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12450-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}