{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T18:42:49Z","timestamp":1783708969946,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662444641","type":"print"},{"value":"9783662444658","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44465-8_47","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T06:33:02Z","timestamp":1407825182000},"page":"553-564","source":"Crossref","is-referenced-by-count":13,"title":["Traveling Salesman Problems in Temporal Graphs"],"prefix":"10.1007","author":[{"given":"Othon","family":"Michail","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"47_CR1","doi-asserted-by":"crossref","unstructured":"Asadpour, A., Goemans, M.X., Madry, A., Gharan, S.O., Saberi, A.: An O(logn\/ loglogn)-approximation algorithm for the asymmetric traveling salesman problem. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 379\u2013389 (2010)","DOI":"10.1137\/1.9781611973075.32"},{"issue":"3","key":"47_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<125::AID-NET1>3.0.CO;2-P","volume":"28","author":"K.A. Berman","year":"1996","unstructured":"Berman, K.A.: Vulnerability of scheduled networks and a generalization of Menger\u2019s theorem. Networks\u00a028(3), 125\u2013134 (1996)","journal-title":"Networks"},{"key":"47_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-3-540-27821-4_6","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Bl\u00e4ser","year":"2004","unstructured":"Bl\u00e4ser, M.: A 3\/4-approximation algorithm for maximum ATSP with weights zero and one. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) APPROX and RANDOM 2004. LNCS, vol.\u00a03122, pp. 61\u201371. Springer, Heidelberg (2004)"},{"key":"47_CR4","doi-asserted-by":"crossref","unstructured":"Cygan, M.: Improved approximation for 3-dimensional matching via bounded pathwidth local search. In: Proceedings of the IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS (2013)","DOI":"10.1109\/FOCS.2013.61"},{"key":"47_CR5","doi-asserted-by":"crossref","unstructured":"Dutta, C., Pandurangan, G., Rajaraman, R., Sun, Z., Viola, E.: On the complexity of information spreading in dynamic networks. In: Proc. of the 24th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 717\u2013736 (2013)","DOI":"10.1137\/1.9781611973105.52"},{"key":"47_CR6","first-page":"550","volume-title":"Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS)","author":"S.O. Gharan","year":"2011","unstructured":"Gharan, S.O., Saberi, A., Singh, M.: A randomized rounding approach to the traveling salesman problem. In: Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 550\u2013559. IEEE Computer Society Press, Washington, DC (2011)"},{"key":"47_CR7","unstructured":"Halld\u00f3rsson, M.M.: Approximating discrete collections via local improvements. In: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 160\u2013169 (1995)"},{"key":"47_CR8","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Kumar, A.: Connectivity and inference problems for temporal networks. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), pp. 504\u2013513 (2000)","DOI":"10.1145\/335305.335364"},{"key":"47_CR9","unstructured":"Karpinski, M., Schmied, R.: On improved inapproximability results for the shortest superstring and related problems. In: Proc. 19th CATS, pp. 27\u201336 (2013)"},{"key":"47_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1007\/978-3-642-39212-2_57","volume-title":"Automata, Languages, and Programming","author":"G.B. Mertzios","year":"2013","unstructured":"Mertzios, G.B., Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Temporal network optimization subject to connectivity constraints. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol.\u00a07966, pp. 657\u2013668. Springer, Heidelberg (2013)"},{"key":"47_CR11","doi-asserted-by":"crossref","unstructured":"Orlin, J.B.: The complexity of dynamic languages and dynamic optimization problems. In: Proceedings of the 13th Annual ACM Symposium on Theory of Computing (STOC), pp. 218\u2013227. ACM (1981)","DOI":"10.1145\/800076.802475"},{"issue":"1","key":"47_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.18.1.1","volume":"18","author":"C.H. Papadimitriou","year":"1993","unstructured":"Papadimitriou, C.H., Yannakakis, M.: The traveling salesman problem with distances one and two. Mathematics of Operations Research\u00a018(1), 1\u201311 (1993)","journal-title":"Mathematics of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44465-8_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T11:36:59Z","timestamp":1558957019000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44465-8_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444641","9783662444658"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44465-8_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}