Approximation algorithms for the capacitated min-max and minimum graph cover problems
From MaRDI portal
Cites work
- Approximation algorithms for distance constrained vehicle routing problems
- Approximation Algorithms for Min-Max Cycle Cover Problems
- Approximation Algorithms for Min–Max Tree Partition
- Approximation algorithms for the multi-vehicle scheduling problem
- Approximation hardness of min-max tree covers
- Approximation results for min-max path cover problems in vehicle routing
- Approximations for minimum and min-max vehicle routing problems
- Better approximability results for min-max tree/cycle/path cover problems
- Data mule scheduling on a path with handling time and time span constraints
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 7758357 (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
- Matching theory
- Min-max tree covers of graphs.
- Minmax tree cover in the Euclidean space
- On the Cube of a Graph
- Saving an epsilon: a 2-approximation for the k-MST problem in graphs
- Steiner tree approximation via iterative randomized rounding
- Vehicle Routing
This page was built for publication: Approximation algorithms for the capacitated min-max and minimum graph cover problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6909264)
