Approximating the Minimum Tour Cover of a Digraph
AbstractGiven a directed graph G with non-negative cost on the arcs, a directed tour cover T of G is a cycle (not necessarily 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, in our knowledge, the DToCP remains widely open. In this paper, we give a 2 log2(n)-approximation algorithm for the DToCP. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Nguyen, V.H. Approximating the Minimum Tour Cover of a Digraph. Algorithms 2011, 4, 75-86.
Nguyen VH. Approximating the Minimum Tour Cover of a Digraph. Algorithms. 2011; 4(2):75-86.Chicago/Turabian Style
Nguyen, Viet Hung. 2011. "Approximating the Minimum Tour Cover of a Digraph." Algorithms 4, no. 2: 75-86.