Approximability of the problem about a minimum-weight cycle cover of a graph
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A 2-approximation algorithm for the metric 2-peripatetic salesman problem
- 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
- On the asymptotic optimality of an algorithm for solving the maximum \(m\)-PSP in a multidimensional Euclidean space
- 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
Cited in
(7)- On the asymptotic optimality of a solution of the Euclidean problem of covering a graph by \(m\) nonadjacent cycles of maximum total weight
- Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles
- A PTAS for MIN-\(k\)-SCCP in Euclidean space of arbitrary fixed dimension
- Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints
- Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem
- An exact algorithm with linear complexity for a problem of visiting megalopolises
- Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles
This page was built for publication: Approximability of the problem about a minimum-weight cycle cover of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q492748)
