Approximating maximum weight cycle covers in directed graphs with weights zero and one

Markus Bläser, Bodo Manthey

Research output: Contribution to journalArticleAcademicpeer-review

22 Citations (Scopus)

Abstract

A cycle cover of a graph is a spanning subgraph each node of which is part of exactly one simple cycle. A $k$-cycle cover is a cycle cover where each cycle has length at least $k$. Given a complete directed graph with edge weights zero and one, Max-$k$-DCC(0, 1) is the problem of finding a k-cycle cover with maximum weight. We present a $\frac{2}{3}$ approximation algorithm for Max-$k$-DCC(0, 1) with running time $O(n^{5/2)}$. This algorithm yields a $\frac{4}{3}$ approximation algorithm for Min-$k$-DCC(1, 2) as well. Instances of the latter problem are complete directed graphs with edge weights one and two. The goal is to find a $k$-cycle cover with minimum weight. We particularly obtain a $\frac{2}{3}$ approximation algorithm for the asymmetric maximum traveling salesman problem with distances zero and one and a $\frac{4}{3}$ approximation algorithm for the asymmetric minimum traveling salesman problem with distances one and two. As a lower bound, we prove that Max-$k$-DCC(0, 1) for $k \geq 3$ and Max$k$-UCC(0, 1) (finding maximum weight cycle covers in undirected graphs) for $k \geq 7$ are APX-complete.
Original languageUndefined
Pages (from-to)121-139
Number of pages19
JournalAlgorithmica
Volume42
Issue number2
DOIs
Publication statusPublished - 2005

Keywords

  • EWI-21255
  • cycle covers
  • Combinatorial optimization
  • IR-79421
  • Inapproximability
  • Traveling Salesman Problem
  • Approximation algorithms

Cite this