Better approximability results for min-max tree/cycle/path cover problems
From MaRDI portal
Recommendations
- Better inapproximability bounds and approximation algorithms for MIN-MAX tree/cycle/path cover problems
- Approximation hardness of min-max tree covers
- Improved approximation algorithms for the min-max tree cover and bounded tree cover problems
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
- Minimum-Weight Cycle Covers and Their Approximability
Cites work
- 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
- A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
- Algorithms and Computation
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Approximation algorithms for distance constrained vehicle routing problems
- Approximation Algorithms for Min-Max Cycle Cover Problems
- Approximation algorithms for the multi-vehicle scheduling problem
- Approximation hardness of min-max tree covers
- Approximation results for a min-max location-routing problem
- Approximation results for min-max path cover problems in vehicle routing
- Approximations for minimum and min-max vehicle routing problems
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1303538 (Why is no real title available?)
- Improved approximation algorithms for some min-max and minimum cycle cover problems
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
- Min-max cover of a graph with a small number of parts
- Min-max tree covers of graphs.
- Minmax tree cover in the Euclidean space
- Planar 3DM is NP-complete
- Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
Cited in
(21)- Vertex covering by paths on trees with its applications in machine translation
- Improved approximations for tour and tree covers
- A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering
- An overview of graph covering and partitioning
- Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints
- Approximation algorithms for some min-max postmen cover problems
- Better inapproximability bounds and approximation algorithms for MIN-MAX tree/cycle/path cover problems
- Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems
- A fast (2 + 2/7)-approximation algorithm for capacitated cycle covering
- Approximation algorithms for the min-max mixed rural postmen cover problem and its variants
- Scheduling on a graph with release times
- The heterogeneous rooted tree cover problem
- A fast 3-approximation for the capacitated tree cover problem with edge loads
- Approximation algorithms for the capacitated min-max and minimum graph cover problems
- Approximating graphic min-max and minimum cycle/path/tree cover problems
- Approximation algorithms for solving the heterogeneous rooted tree/path cover problems
- A strongly polynomial time approximation algorithm for the min-max clustered cycle cover problem
- Approximation algorithms for the capacitated min-max and minimum graph cover problems
- Approximation algorithm for the min-max partial tree cover problem
- Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
- Approximation hardness of min-max tree covers
This page was built for publication: Better approximability results for min-max tree/cycle/path cover problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2420656)
