Abstract
Given a directed graph G with non-negative cost on the arcs, a directed tour cover T of G is a cycle (not necessary simple) in G such that either head or tail (or both of them) of every arc in G is touched by T. The minimum directed tour cover problem (DToCP) which is to find a directed tour cover of minimum cost, is NP-hard. It is thus interesting to design approximation algorithms with performance guarantee to solve this problem. Although its undirected counterpart (ToCP) has been studied in recent years [1,6], in our knowledge, the DTCP remains widely open. In this paper, we give a 2log2(n)-approximation algorithm for the DTCP.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Arkin, E.M., Halldórsson, M.M., Hassin, R.: Approximating the Tree and Tour Covers of a Graph. Information Processing Letters 47, 275–282 (1993)
Frieze, A.M., Galbiati, G., Maffioli, F.: On the Worst Case Performance of some Algorithms for the Asymmetric Traveling Salesman problem. Networks 12, 23–39 (1982)
Goemans, M.X., Bertsimas, D.J.: On the Parsimonious Property of Connectivity Problems. In: Proc. of the 1st ACM-SIAM Symposimum on Disc. Alg (SODA 1990), pp. 388–396 (1990)
Jackson, B.: Some Remarks on Arc-Connectivity, Vertex Splitting, and Orientation in Graphs and Digraphs. Journal of Graph Theory 12(3), 429–436 (1988)
Kaplan, H., Lewenstein, M., Shafrir, N., Sviridenko, M.: Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular multigraphs. J. ACM 52(4), 602–626 (2005)
Könemann, J., Konjevod, G., Parekh, O., Sinha, A.: Improved Approximations for Tour and Tree Covers. Algorithmica 38(3), 441–449 (2003)
Lovasz, L.: On Some Connectivity Properties of Eulerian Graphs. Acta Mathematica Hungarica 28, 129–138 (1976)
Williamson, D.P.: Analysis of the Held-Karp Heuristic for the Traveling Salesman Problem. Master Thesis, MIT (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nguyen, V.H. (2009). A 2log2(n)-Approximation Algorithm for Directed Tour Cover. In: Du, DZ., Hu, X., Pardalos, P.M. (eds) Combinatorial Optimization and Applications. COCOA 2009. Lecture Notes in Computer Science, vol 5573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02026-1_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-02026-1_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02025-4
Online ISBN: 978-3-642-02026-1
eBook Packages: Computer ScienceComputer Science (R0)