The following pages link to (Q3840354):
Displaying 15 items.
- Towards more practical linear programming-based techniques for algorithmic mechanism design (Q506527) (← links)
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- A note on multiflows and treewidth (Q834591) (← links)
- Finding disjoint paths with related path costs (Q857785) (← links)
- Disjoint paths in sparse graphs (Q967419) (← links)
- A note on the greedy algorithm for the unsplittable flow problem (Q1028992) (← links)
- Approximating covering integer programs with multiplicity constraints (Q1406040) (← links)
- Approximating disjoint-path problems using packing integer programs (Q1424288) (← links)
- Approximating low-congestion routing and column-restricted packing problems (Q1607041) (← links)
- Conversion of coloring algorithms into maximum weight independent set algorithms (Q1775063) (← links)
- Finding multiple induced disjoint paths in general graphs (Q1944193) (← links)
- On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints (Q1975964) (← links)
- Shortest node-disjoint paths on random graphs (Q3301996) (← links)
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems (Q5917535) (← links)
- Solving the edge‐disjoint paths problem using a two‐stage method (Q6066718) (← links)
