On the asymptotic optimality of a solution of the Euclidean problem of covering a graph by m nonadjacent cycles of maximum total weight
From MaRDI portal
(Redirected from Publication:294361)
On the asymptotic optimality of a solution of the Euclidean problem of covering a graph by \(m\) nonadjacent cycles of maximum total weight
On the asymptotic optimality of a solution of the Euclidean problem of covering a graph by \(m\) nonadjacent cycles of maximum total weight
Recommendations
- Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles
- On asymptotically optimal solvability of max \(m\)-\(k\)-cycles cover problem in a normed space
- A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph
- On approximating maximum covering cycles in undirected graphs
- Approximating maximum weight cycle covers in directed graphs with weights zero and one
- Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight
- scientific article; zbMATH DE number 3929052
- Approximation algorithms for maximum weight k-coverings of graphs by packings
- Covering a graph with nontrivial vertex-disjoint paths: existence and optimization
- scientific article; zbMATH DE number 3966112
Cites work
Cited in
(6)- A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph
- Searching for a cycle with maximum coverage in undirected graphs
- Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles
- Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles
- On asymptotically optimal solvability of max \(m\)-\(k\)-cycles cover problem in a normed space
- Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces
This page was built for publication: On the asymptotic optimality of a solution of the Euclidean problem of covering a graph by \(m\) nonadjacent cycles of maximum total weight
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294361)
