Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems
- 23 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 28 references indexed in Scilit:
- An Extension of the Lovász Local Lemma, and its Applications to Integer ProgrammingSIAM Journal on Computing, 2006
- Path coloring on the meshPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Static and Dynamic Path Selection on Expander Graphs: A Random Walk ApproachRandom Structures & Algorithms, 1999
- A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteriaPublished by Association for Computing Machinery (ACM) ,1997
- Improved approximations of packing and covering problemsPublished by Association for Computing Machinery (ACM) ,1995
- Existence and Construction of Edge-Disjoint Paths on Expander GraphsSIAM Journal on Computing, 1994
- An O (log N ) deterministic packet-routing schemeJournal of the ACM, 1992
- Constructing disjoint paths on expander graphsCombinatorica, 1989
- Probabilistic construction of deterministic algorithms: Approximating packing integer programsJournal of Computer and System Sciences, 1988
- Randomized rounding: A technique for provably good algorithms and algorithmic proofsCombinatorica, 1987