Pages that link to "Item:Q1028118"
From MaRDI portal
The following pages link to Minimum-weight cycle covers and their approximability (Q1028118):
Displayed 5 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)
- Relaxations of Combinatorial Problems Via Association Schemes (Q2802525) (← links)
- Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem (Q3467845) (← links)
- Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles (Q6194910) (← links)