Approximability of the minimum-weight k-size cycle cover problem
From MaRDI portal
Publication:330503
Recommendations
- Approximation of Euclidean \(k\)-size cycle cover problem
- A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph
- A PTAS for MIN-\(k\)-SCCP in Euclidean space of arbitrary fixed dimension
- Constant-factor approximations for cycle cover problems
- Improved approximation algorithms for min-max and minimum vehicle routing problems
Cites work
- scientific article; zbMATH DE number 3485514 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1875429 (Why is no real title available?)
- scientific article; zbMATH DE number 1452992 (Why is no real title available?)
- An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
- Approximating maximum weight cycle covers in directed graphs with weights zero and one
- Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2
- Asymptotically optimal algorithm for finding one and two edge-disjoint traveling salesman routes of maximal weight in Euclidean space
- Introduction to algorithms
- Lower bounds for symmetricK-peripatetic salesman problems
- Minimum-weight cycle covers and their approximability
- On Approximating Restricted Cycle Covers
- On the relationship between ATSP and the cycle cover problem
- P-Complete Approximation Problems
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Quad trees: A data structure for retrieval by composite keys
- The Euclidean traveling salesman problem is NP-complete
- The truck dispatching problem
- The vehicle routing problem. Latest advances and new challenges.
Cited in
(17)- Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces
- Constant-factor approximations for cycle cover problems
- An overview of graph covering and partitioning
- Approximating the Minimum Tour Cover with a Compact Linear Program
- A fast \((2 + 2/7)\)-approximation algorithm for capacitated cycle covering
- Approximability of the minimum Steiner cycle problem
- Approximating maximum weight cycle covers in directed graphs with weights zero and one
- A PTAS for MIN-\(k\)-SCCP in Euclidean space of arbitrary fixed dimension
- Approximation algorithms with constant factors for a series of asymmetric routing problems
- Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles
- Randomized approximation scheme for Steiner multi cycle in the Euclidean plane
- New approximation algorithms for the rooted budgeted cycle cover problem
- Improved approximation algorithms for min-max and minimum vehicle routing problems
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
- New approximation algorithms for the rooted budgeted cycle cover problem
- Approximation algorithms for some minimum postmen cover problems
- Approximation of Euclidean \(k\)-size cycle cover problem
This page was built for publication: Approximability of the minimum-weight \(k\)-size cycle cover problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q330503)
