Skip to main content
SpringerLink
Log in

An Approximation Algorithm for the Minimum Co-Path Set Problem

  • Published:
Algorithmica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Berman, P., Karpinski, M.: 8/7-approximation algorithm for (1,2)-TSP. In: ACM-SIAM Proceedings of the Seventeenth Annual Symposium on Discrete Algorithms (SODA’06), pp. 641–648 (2006)

  2. Bodlaender, H.L.: Planar graphs with bounded treewidth. Technical Report RUU-CS-88-14, Department of Computer Science, University of Utrecht (March 1988)

  3. Cheng, Y., Cai, Z., Goebel, R., Lin, G., Zhu, B.: The radiation hybrid map construction problem: recognition, hardness, and approximation algorithms. Unpublished Manuscript (2008)

  4. Cox, D.R., Burmeister, M., Price, E.R., Kim, S., Myers, R.M.: Radiation hybrid mapping: a somatic cell genetic method for constructing high resolution maps of mammalian chromosomes. Science 250, 245–250 (1990)

    Article  Google Scholar 

  5. Engebretsen, L.: An explicit lower bound for TSP with distances one and two. Algorithmica 35(4), 301–318 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  6. Papadimitriou, C.H., Yannakakis, M.: The traveling salesman problem with distances one and two. Math. Oper. Res. 18(1), 1–11 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  7. Richard, C.W., Withers, D.A., Meeker, T.C., Maurer, S., Evans, G.A., Myers, R.M., Cox, D.R.: A radiation hybrid map of the proximal long arm of human chromosome 11, containing the multiple endocrine neoplasia type 1 (MEN-l) and bcl-1 disease loci. Am. J. Human Genet. 49, 1189–1196 (1991)

    Google Scholar 

  8. Slonim, D., Kruglyak, L., Stein, L., Lander, E.: Building human genome maps with radiation hybrids. J. Comput. Biol. 4, 487–504 (1997)

    Article  Google Scholar 

  9. Vishwanathan, S.: An approximation algorithm for the asymmetric travelling salesman problem with distances one and two. Inf. Process. Lett. 44, 297–302 (1992)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, Saitama, 350-0394, Japan

    Zhi-Zhong Chen

  2. Department of Computing Science, University of Alberta, Edmonton, Alberta, T6G 2E8, Canada

    Guohui Lin

  3. Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong

    Lusheng Wang

Authors
  1. Zhi-Zhong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guohui Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lusheng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhi-Zhong Chen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, ZZ., Lin, G. & Wang, L. An Approximation Algorithm for the Minimum Co-Path Set Problem. Algorithmica 60, 969–986 (2011). https://doi.org/10.1007/s00453-010-9389-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-010-9389-x

Keywords

Search

Navigation