Pages that link to "Item:Q5387766"
From MaRDI portal
The following pages link to Approximability of Packing Disjoint Cycles (Q5387766):
Displaying 8 items.
- Approximability of packing disjoint cycles (Q534781) (← links)
- Approximation algorithms for grooming in optical network design (Q551206) (← links)
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- Disjoint cycles intersecting a set of vertices (Q713977) (← links)
- Induced packing of odd cycles in planar graphs (Q764360) (← links)
- Packing disjoint cycles over vertex cuts (Q973127) (← links)
- New tools and connections for exponential-time approximation (Q2272598) (← links)
- Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)
