Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems
DOI10.1007/978-3-642-22935-0_26zbMath1343.68314OpenAlexW198434069MaRDI QIDQ3088103
Mohammad R. Salavatipour, M. Reza Khani
Publication date: 17 August 2011
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22935-0_26
Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (2)
Cites Work
- Approximation hardness of min-max tree covers
- Approximating the \(k\)-traveling repairman problem with repair times
- Approximation algorithms for distance constrained vehicle routing problems
- Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time
- On the Distance Constrained Vehicle Routing Problem
- Approximation Algorithms for Min–Max Tree Partition
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Approximations for minimum and min-max vehicle routing problems
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
This page was built for publication: Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems