Next Article in Journal
Goodness-of-Fit Tests For Elliptical and Independent Copulas through Projection Pursuit
Previous Article in Journal
Compressed Matching in Dictionaries
Article Menu

Export Article

Open AccessArticle
Algorithms 2011, 4(2), 75-86; doi:10.3390/a4020075

Approximating the Minimum Tour Cover of a Digraph

LIP6, Universite Pierre et Marie Curie Paris 6, 4 place Jussieu, Paris, France
Received: 2 March 2011 / Revised: 24 March 2011 / Accepted: 2 April 2011 / Published: 20 April 2011
View Full-Text   |   Download PDF [179 KB, uploaded 20 April 2011]

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. View Full-Text
Keywords: approximation algorithm; graph algorithm; packing and covering; tour cover; tree cover approximation algorithm; graph algorithm; packing and covering; tour cover; tree cover
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Scifeed alert for new publications

Never 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

SciFeed Share & Cite This Article

MDPI and ACS Style

Nguyen, V.H. Approximating the Minimum Tour Cover of a Digraph. Algorithms 2011, 4, 75-86.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top