On the asymptotic optimality of a solution of the Euclidean problem of covering a graph by \(m\) nonadjacent cycles of maximum total weight

DOI10.1134/S1064562416010233zbMath1339.05309MaRDI QIDQ294361

I. A. Rykov, E. Kh. Gimadi

Publication date: 16 June 2016

Published in: Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

\(m\) nonadjacent cycles of maximum total weight

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Signed and weighted graphs (05C22)

Related Items (2)

Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces ⋮ Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles

Cites Work

• Approximability of the problem about a minimum-weight cycle cover of a graph
• Minimum-weight cycle covers and their approximability
• The traveling salesman problem and its variations
• Unnamed Item

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