Pages that link to "Item:Q534781"
From MaRDI portal
The following pages link to Approximability of packing disjoint cycles (Q534781):
Displaying 8 items.
- A note on disjoint cycles (Q413261) (← links)
- On packing shortest cycles in graphs (Q989491) (← links)
- Approximating disjoint-path problems using packing integer programs (Q1424288) (← links)
- Odd cycle packing (Q2875196) (← links)
- Approximation algorithms for cycle packing problems (Q2921712) (← links)
- Maximum cycle packing using SPR-trees (Q5009941) (← links)
- Packing Cycles Faster Than Erdos--Posa (Q5232148) (← links)
- Approximability of Packing Disjoint Cycles (Q5387766) (← links)