Abstract
In this work, we introduce the notion of time to some well-known combinatorial optimization problems. In particular, we study problems defined on temporal graphs. A temporal graph D = (V,A) may be viewed as a time-sequence G 1,G 2…,G l of static graphs over the same (static) set of nodes V. Each G t = D(t) = (V,A(t)) is called the instance of D at time t and l is called the lifetime of D. Our main focus is on analogues of traveling salesman problems in temporal graphs. A sequence of time-labeled edges (e.g. a tour) is called temporal if its labels are strictly increasing. We begin by considering the problem of exploring the nodes of a temporal graph as soon as possible. In contrast to the positive results known for the static case, we prove that, it cannot be approximated within cn, for some constant c > 0, in general temporal graphs and within (2 − ε), for every constant ε > 0, in the special case in which D(t) is connected for all 1 ≤ t ≤ l, both unless P = NP. We then study the temporal analogue of TSP(1,2), abbreviated TTSP(1,2), where, for all 1 ≤ t ≤ l, D(t) is a complete weighted graph with edge-costs from {1,2} and the cost of an edge may vary from instance to instance. The goal is to find a minimum cost temporal TSP tour. We give several polynomial-time approximation algorithms for TTSP(1,2). Our best approximation is (1.7 + ε) for the generic TTSP(1,2) and (13/8 + ε) for its interesting special case in which the lifetime of the temporal graph is restricted to n. In the way, we also introduce temporal versions of other fundamental combinatorial optimization problems, for which we obtain polynomial-time approximation algorithms and hardness results.
Supported in part by the (i) project FOCUS, “ARISTEIA” Action, OP EdLL, EU and Greek National Resources, (ii) FET EU IP project MULTIPLEX under contract no 317532, and (iii) School of EEE/CS of the Univ. of Liverpool. Full version: http://ru1.cti.gr/aigaion/?page=publication&kind=single&ID=1051
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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–389 (2010)
Berman, K.A.: Vulnerability of scheduled networks and a generalization of Menger’s theorem. Networks 28(3), 125–134 (1996)
Bläser, 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. 3122, pp. 61–71. Springer, Heidelberg (2004)
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)
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–736 (2013)
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–559. IEEE Computer Society Press, Washington, DC (2011)
Halldórsson, M.M.: Approximating discrete collections via local improvements. In: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 160–169 (1995)
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–513 (2000)
Karpinski, M., Schmied, R.: On improved inapproximability results for the shortest superstring and related problems. In: Proc. 19th CATS, pp. 27–36 (2013)
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. 7966, pp. 657–668. Springer, Heidelberg (2013)
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–227. ACM (1981)
Papadimitriou, C.H., Yannakakis, M.: The traveling salesman problem with distances one and two. Mathematics of Operations Research 18(1), 1–11 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Michail, O., Spirakis, P.G. (2014). Traveling Salesman Problems in Temporal Graphs. In: Csuhaj-Varjú, E., Dietzfelbinger, M., Ésik, Z. (eds) Mathematical Foundations of Computer Science 2014. MFCS 2014. Lecture Notes in Computer Science, vol 8635. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44465-8_47
Download citation
DOI: https://doi.org/10.1007/978-3-662-44465-8_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44464-1
Online ISBN: 978-3-662-44465-8
eBook Packages: Computer ScienceComputer Science (R0)