Approximation algorithm for the min-max partial tree cover problem
From MaRDI portal
Cites work
- A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree
- A framework for vehicle routing approximation schemes in trees
- Approximating graphic min-max and minimum cycle/path/tree cover problems
- Approximating the minmax rooted-tree cover in a tree
- Approximation algorithms for distance constrained vehicle routing problems
- Approximation Algorithms for Min-Max Cycle Cover Problems
- Approximation algorithms for the capacitated min-max and minimum graph cover problems
- Approximation algorithms for the min-max mixed rural postmen cover problem and its variants
- Approximation hardness of min-max tree covers
- Approximation results for min-max path cover problems in vehicle routing
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Approximations for minimum and min-max vehicle routing problems
- Better approximability results for min-max tree/cycle/path cover problems
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
- scientific article; zbMATH DE number 1875417 (Why is no real title available?)
- Improved approximation algorithms for some min-max and minimum cycle cover problems
- Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
- Min-max tree covers of graphs.
- Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems
This page was built for publication: Approximation algorithm for the min-max partial tree cover problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7314150)
