The following pages link to (Q5501283):
Displayed 11 items.
- Approximability of packing disjoint cycles (Q534781) (← links)
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- The checkpoint problem (Q714790) (← links)
- On the Max-flow min-cut ratio for directed multicommodity flows (Q818146) (← links)
- Finding disjoint paths with related path costs (Q857785) (← links)
- An \(O(\sqrt n)\)-approximation algorithm for directed sparsest cut (Q1045922) (← links)
- Finding edge-disjoint paths in networks: an ant colony optimization algorithm (Q2466394) (← links)
- On the disjoint paths problem (Q2643811) (← links)
- Routing in Undirected Graphs with Constant Congestion (Q2817791) (← links)
- Approximability of Packing Disjoint Cycles (Q5387766) (← links)
- Greedy approximation algorithms for directed multicuts (Q5463671) (← links)