The following pages link to (Q2921712):
Displaying 8 items.
- Approximation algorithms for grooming in optical network design (Q551206) (← links)
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- Packing directed cycles efficiently (Q867851) (← links)
- Efficient approximation algorithms for shortest cycles in undirected graphs (Q987804) (← links)
- An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) (Q1751097) (← links)
- Maximum cycle packing in Eulerian graphs using local traces (Q2259574) (← links)
- Packing arc-disjoint cycles in tournaments (Q2663711) (← links)
- Packing Arc-Disjoint Cycles in Tournaments (Q5092386) (← links)
