Pages that link to "Item:Q1028118"
From MaRDI portal
The following pages link to Minimum-weight cycle covers and their approximability (Q1028118):
Displaying 13 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)
- A parallel algorithm for approximating the minimum cycle cover (Q1207326) (← links)
- Proofs of two minimum circuit cover conjectures (Q1569041) (← links)
- On approximating maximum covering cycles in undirected graphs (Q2414126) (← links)
- Approximating maximum weight cycle covers in directed graphs with weights zero and one (Q2483998) (← links)
- Approximately covering by cycles in planar graphs. (Q2768325) (← links)
- Relaxations of Combinatorial Problems Via Association Schemes (Q2802525) (← links)
- Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem (Q3467845) (← links)
- On Approximating Restricted Cycle Covers (Q3614154) (← links)
- STACS 2005 (Q5710715) (← links)
- New approximation algorithms for the minimum cycle cover problem (Q5919633) (← links)
- Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles (Q6194910) (← links)
