Skip to main content
Springer Nature Link
Log in

Better approximability results for min–max tree/cycle/path cover problems

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

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 article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

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

    Article  MathSciNet  MATH  Google Scholar 

  • Arora S, Grigni M, Karger DR, Klein P, Woloszyn A (1998) 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

  • Bhattacharya B, Hu Y (2010) Approximation algorithms for the multi-vehicle scheduling problem. In: Cheong O, Chwa K-Y, Park K (eds) The proceedings of the 21th international symposium on algorithms and computation. Lecture notes in computer science, vol 6507. Springer, Heidelberg, pp 192–205

  • Campbell AM, Vandenbussche D, Hermann W (2008) Routing for relief efforts. Transp Sci 42:127–145

    Article  Google Scholar 

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

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

    Article  MATH  Google Scholar 

  • Even G, Garg N, Koemann J, Ravi R, Sinha A (2004) Min–max tree covers of graphs. Oper Res Lett 32:309–315

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Frederickson GN, Hecht MS, Kim CE (1978) Approximation algorithms for some routing problems. SIAM J Comput 7(2):178–193

    Article  MathSciNet  Google Scholar 

  • Garey M, Johnson D (1979) Computers and intractability. Freeman, San Francisco

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Jorati A (2013) Approximation algorithms for some min–max vehicle routing problems. Master Thesis, University of Alberta

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Khani MR, Salavatipour MR (2014) Approximation algorithms for min–max tree cover and bounded tree cover problems. Algorithmica 69:443–460

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  • Nagamochi H, Okada K (2003) Polynomial time 2-approximation algorithms for the minmax subtree cover problem. In: Ibaraki T, Katoh N, Ono H (eds) The proceedings of the 14th international symposium on algorithms and computation. Lecture notes in computer science, vol 2096. Springer, Heidelberg, pp 138–147

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

    Article  MathSciNet  MATH  Google Scholar 

  • Sebo A, Vygen J (2014) Shorter tours by nicer ears: 7/5-approximation for graphic TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs. Combinatorica 34:597–629

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

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

Author information

Authors and Affiliations

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

    Wei Yu & Zhaohui Liu

Authors
  1. Wei Yu
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Zhaohui Liu
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Wei Yu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yu, W., Liu, Z. Better approximability results for min–max tree/cycle/path cover problems. J Comb Optim 37, 563–578 (2019). https://doi.org/10.1007/s10878-018-0268-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-018-0268-8

Keywords