Pages that link to "Item:Q330503"
From MaRDI portal
The following pages link to Approximability of the minimum-weight \(k\)-size cycle cover problem (Q330503):
Displaying 9 items.
- Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces (Q1675324) (← links)
- An overview of graph covering and partitioning (Q2142633) (← 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)
- New approximation algorithms for the rooted budgeted cycle cover problem (Q5918725) (← links)
- Approximation algorithms for some minimum postmen cover problems (Q5918771) (← links)
- New approximation algorithms for the rooted budgeted cycle cover problem (Q5925709) (← links)
- Approximation algorithms with constant factors for a series of asymmetric routing problems (Q6194441) (← links)
- Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles (Q6194910) (← links)
