Pages that link to "Item:Q492748"
From MaRDI portal
The following pages link to Approximability of the problem about a minimum-weight cycle cover of a graph (Q492748):
Displaying 7 items.
- On the asymptotic optimality of a solution of the Euclidean problem of covering a graph by \(m\) nonadjacent cycles of maximum total weight (Q294361) (← links)
- An exact algorithm with linear complexity for a problem of visiting megalopolises (Q2396369) (← links)
- Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles (Q2396372) (← links)
- A PTAS for MIN-\(k\)-SCCP in Euclidean space of arbitrary fixed dimension (Q2396378) (← links)
- Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem (Q3467845) (← links)
- Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints (Q5040957) (← links)
- Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles (Q6194910) (← links)
