Approximating the Minimum Tour Cover with a Compact Linear Program
From MaRDI portal
Recommendations
- Approximating the minimum tour cover of a digraph
- Linear and Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours
- An approximation algorithm for the total covering problem
- Approximation Algorithms for Min-Max Cycle Cover Problems
- Covering tours and cycle covers with turn costs: hardness and approximation
- scientific article; zbMATH DE number 1003236
- Complexity and approximability of minimum path-collection exact covers
- On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
- Approximability of the minimum-weight \(k\)-size cycle cover problem
- Optimal covering tours with turn costs
Cites work
- scientific article; zbMATH DE number 1953187 (Why is no real title available?)
- A 2-approximation algorithm for the minimum weight edge dominating set problem
- A \(2\frac{1}{10}\)-approximation algorithm for a generalization of the weighted edge-dominating set problem
- Approximating the tree and tour covers of a graph
- How to trim a MST, a 2-approximation algorithm for minimum cost-tree cover
- Improved approximations for tour and tree covers
- Worst-case analysis of a new heuristic for the travelling salesman problem
Cited in
(6)- A 2log2(n)-Approximation Algorithm for Directed Tour Cover
- Graph covering using bounded size subgraphs
- Approximating the minimum tour cover of a digraph
- Improved approximations for tour and tree covers
- Covering tours and cycle covers with turn costs: hardness and approximation
- scientific article; zbMATH DE number 1670541 (Why is no real title available?)
This page was built for publication: Approximating the Minimum Tour Cover with a Compact Linear Program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192959)
