Pages that link to "Item:Q3455967"
From MaRDI portal
The following pages link to Approximation of Euclidean k-size cycle cover problem (Q3455967):
Displaying 4 items.
- Approximability of the minimum-weight \(k\)-size cycle cover problem (Q330503) (← links)
- A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph (Q492282) (← links)
- A PTAS for MIN-\(k\)-SCCP in Euclidean space of arbitrary fixed dimension (Q2396378) (← links)
- The Euclidean distance completion problem: cycle completability (Q4853938) (← links)