Pages that link to "Item:Q492282"
From MaRDI portal
The following pages link to A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph (Q492282):
Displaying 11 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)
- Approximability of the minimum-weight \(k\)-size cycle cover problem (Q330503) (← links)
- Randomized approximation scheme for Steiner multi cycle in the Euclidean plane (Q2192387) (← links)
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters (Q2294592) (← 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)
- Approximation Algorithms for Multi-Robot Patrol-Scheduling with Min-Max Latency (Q3381954) (← links)
- Approximation of Euclidean k-size cycle cover problem (Q3455967) (← links)
- Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem (Q3467845) (← links)
- The Euclidean distance completion problem: cycle completability (Q4853938) (← links)
