Skip to main content
SpringerLink
Log in

Better Inapproximability Bounds and Approximation Algorithms for Min-Max Tree/Cycle/Path Cover Problems

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10392))

Included in the following conference series:

Abstract

We study the problem of covering the vertices of an undirected weighted graph with a given number of trees (cycles, paths) to minimize the weight of the maximum weight tree (cycle, path). Improved inapproximability lower bounds are proved and better approximation algorithms are designed for several variants of this problem.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Arkin, E.M., Hassin, R., Levin, A.: Approximations for minimum and min-max vehicle routing problems. J. Algorithms 59, 1–18 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Arora, S.: Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. J. ACM 45, 753–782 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  3. Arora, S., Grigni, M., Karger, D.R., Klein, P., Woloszyn, A.: A polynomial-time approximation scheme for weighted planar graph TSP. In: the Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 33–41 (1998)

    Google Scholar 

  4. Bhattacharya, B., Hu, Y.: Approximation algorithms for the multi-vehicle scheduling problem. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6507, pp. 192–205. Springer, Heidelberg (2010). doi:10.1007/978-3-642-17514-5_17

    Chapter  Google Scholar 

  5. Campbell, A.M., Vandenbussche, D., Hermann, W.: Routing for relief efforts. Transportation Sci. 42, 127–145 (2008)

    Article  Google Scholar 

  6. Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA (1976)

    Google Scholar 

  7. Dyer, M., Frieze, A.: Planar 3DM is NP-complete. J. Algroithms 7, 174–184 (1986)

    Article  MATH  Google Scholar 

  8. Even, G., Garg, N., Koemann, J., Ravi, R., Sinha, A.: Min-max tree covers of graphs. Operations Res. Letters 32, 309–315 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. Farbstein, B., Levin, A.: Min-max cover of a graph with a small number of parts. Discrete Optimiz. 16, 51–61 (2015)

    Article  MathSciNet  Google Scholar 

  10. Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. SIAM J. Comput. 7(2), 178–193 (1978)

    Article  MathSciNet  Google Scholar 

  11. Garey, M., Johnson, D.: Computers and Intractability. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  12. Hopcroft, J., Karp, R.: An \(n^{2.5}\) algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2, 225–231 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  13. Jorati, A.: Approximation algorithms for some min-max vehicle routing problems. Master thesis, University of Alberta (2013)

    Google Scholar 

  14. Karakawa, S., Morsy, E., Nagamochi, H.: Minmax tree cover in the euclidean space. J. Graph Algorithms Appl. 15, 345–371 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  15. Karuno, Y., Nagamochi, H.: 2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. Discrete Appl. Mathe. 129, 433–447 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  16. Khani, M.R., Salavatipour, M.R.: Approximation algorithms for min-max tree cover and bounded tree cover problems. Algorithmica 69, 443–460 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  17. Klein, P.: A linear-time approximation scheme for TSP in undirected planar graphs with edge-weights. SIAM J. Comput. 37, 1926–1952 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  18. Nagamochi, H.: Approximating the minmax rooted-subtree cover problem. IEICE Trans. Fund. Electron. E88–A, 1335–1338 (2005)

    Article  Google Scholar 

  19. Nagamochi, H., Okada, K.: Polynomial time 2-approximation algorithms for the minmax subtree cover problem. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 138–147. Springer, Heidelberg (2003). doi:10.1007/978-3-540-24587-2_16

    Chapter  Google Scholar 

  20. Nagamochi, H., Okada, K.: Approximating the minmax rooted-tree cover in a tree. Inf. Process. Lett. 104, 173–178 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  21. Nagarajan, V., Ravi, R.: Approximation algorithms for distance constrained vehicle routing problems. Networks 59(2), 209–214 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  22. Xu, W., Liang, W., Lin, X.: Approximation algorithms for min-max cycle cover problems. IEEE Trans. Comput. 64, 600–613 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  23. Xu, Z., Wen, Q.: Approximation hardness of min-max tree covers. Oper. Res. Lett. 38, 408–416 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  24. Xu, Z., Xu, L., Li, C.-L.: Approximation results for min-max path cover problems in vehicle routing. Nav. Res. Log. 57, 728–748 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  25. Xu, Z., Xu, L., Zhu, W.: Approximation results for a min-max location-routing problem. Discrete Appl. Mathe. 160, 306–320 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  26. Yu, W., Liu, Z.: Improved approximation algorithms for some min-max and minimum cycle cover problems. Theor. Comput. Sci. 654, 45–58 (2016)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

This research is supported in part by the National Natural Science Foundation of China under grants number 11671135, 11301184.

Author information

Authors and Affiliations

  1. Department of Mathematics, East China University of Science and Technology, Shanghai, 200237, China

    Wei Yu & Zhaohui Liu

Authors
  1. Wei Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhaohui Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhaohui Liu .

Editor information

Editors and Affiliations

  1. Department of Computing, Hong Kong Polytechnic University, Hong Kong, China

    Yixin Cao

  2. Texas A&M University, College Station, Texas, USA

    Jianer Chen

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Yu, W., Liu, Z. (2017). Better Inapproximability Bounds and Approximation Algorithms for Min-Max Tree/Cycle/Path Cover Problems. In: Cao, Y., Chen, J. (eds) Computing and Combinatorics. COCOON 2017. Lecture Notes in Computer Science(), vol 10392. Springer, Cham. https://doi.org/10.1007/978-3-319-62389-4_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-62389-4_45

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-62388-7

  • Online ISBN: 978-3-319-62389-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation