Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems

@article{Baveja2000ApproximationAF,
  title={Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems},
  author={Alok Baveja and Aravind Srinivasan},
  journal={Math. Oper. Res.},
  year={2000},
  volume={25},
  pages={255-280}
}
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths for these requests. We present improved approximation algorithms and/or integrality gaps for all problems considered; the central theme of this work is the underlying multi-commodity flow relaxation. Applications of these techniques to approximating families of packing integer programs are also presented. 
Highly Influential
This paper has highly influenced 18 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 93 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
58 Citations
29 References
Similar Papers

Citations

Publications citing this paper.

93 Citations

051015'98'02'07'12'17
Citations per Year
Semantic Scholar estimates that this publication has 93 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 29 references

Static and dynamic path selection on expander graphs : a random walk approach

  • A. Broder, E. Upfal
  • Random Structures & Algorithms
  • 1999

An extension of the Lovász Local Lemma , and its applications to integer programming

  • E. Upfal
  • Proc . ACM - SIAM Symposium on Discrete…
  • 1996

Circuit switching: a multi-commodity flow based approach

  • F. T. Leighton, S. B. Rao
  • Proc. Workshop on Randomized Parallel
  • 1996
2 Excerpts

Similar Papers

Loading similar papers…