Pages that link to "Item:Q3614154"
From MaRDI portal
The following pages link to On Approximating Restricted Cycle Covers (Q3614154):
Displaying 13 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)
- Minimum-weight cycle covers and their approximability (Q1028118) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Covering tours and cycle covers with turn costs: hardness and approximation (Q2294052) (← links)
- On approximating maximum covering cycles in undirected graphs (Q2414126) (← links)
- A note about shortest cycle covers (Q2581631) (← links)
- Approximately covering by cycles in planar graphs. (Q2768325) (← links)
- Two Approximation Algorithms for ATSP with Strengthened Triangle Inequality (Q3183477) (← links)
- Polynomial Time Approximation Scheme for Single-Depot Euclidean Capacitated Vehicle Routing Problem (Q3467845) (← links)
- STACS 2005 (Q5710715) (← links)
- Polynomial-time approximability of the asymmetric problem of covering a graph by a bounded number of cycles (Q6194910) (← links)
- Improved approximation algorithms for cycle and path packings (Q6575393) (← links)
