We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Approximating the Minimum Tour Cover of a Digraph.
- Authors
Viet Hung Nguyen
- Abstract
Given 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.
- Subjects
DIRECTED graphs; ARCSINE function; APPROXIMATION algorithms; MATHEMATICAL optimization; MATHEMATICAL analysis
- Publication
Algorithms, 2011, Vol 4, Issue 2, p75
- ISSN
1999-4893
- Publication type
Article
- DOI
10.3390/a4020075