An Approximation Algorithm for the Minimum Co-Path Set Problem

  • Authors:

  • Zhi-Zhong Chen;Guohui Lin;Lusheng Wang

  • Affiliations:

  • Tokyo Denki University, Department of Mathematical Sciences, Hatoyama, 350-0394, Saitama, Japan;University of Alberta, Department of Computing Science, T6G 2E8, Edmonton, Alberta, Canada;City University of Hong Kong, Department of Computer Science, Tat Chee Avenue, Kowloon, Hong Kong

  • Venue:
  • Algorithmica
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present an approximation algorithm for the problem of finding a minimum set of edges in a given graph G whose removal from G leaves a graph in which each connected component is a path. It achieves a ratio of $\frac {10}{7}$ and runs in O(n 1.5) time, where n is the number of vertices in the input graph. The previously best approximation algorithm for this problem achieves a ratio of 2 and runs in O(n 2) time.