Improved bounds for the unsplittable flow problem

[1]  Petr Kolman,et al.  A note on the greedy algorithm for the unsplittable flow problem , 2003, Inf. Process. Lett..

[2]  Sanjeev Khanna,et al.  Edge disjoint paths revisited , 2003, SODA '03.

[3]  Christian Scheideler,et al.  Simple on-line algorithms for the maximum disjoint paths problem , 2001, SPAA '01.

[4]  Yossi Azar,et al.  Strongly Polynomial Algorithms for the Unsplittable Flow Problem , 2001, IPCO.

[5]  Aravind Srinivasan,et al.  Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems , 2000, Math. Oper. Res..

[6]  C. Scheideler.  Probabilistic Methods for Coordination Problems , 2000 .

[7]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[8]  Venkatesan Guruswami,et al.  Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 1999, STOC '99.

[9]  Michel X. Goemans,et al.  On the Single-Source Unsplittable Flow Problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[10]  Klaus Jansen,et al.  Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization , 1998 .

[11]  Bruce A. Reed,et al.  Further algorithmic aspects of the local lemma , 1998, STOC '98.

[12]  Jon M. Kleinberg,et al.  Decision algorithms for unsplittable flow and the half-disjoint paths problem , 1998, STOC '98.

[13]  Christian Scheideler,et al.  Universal Routing Strategies for Interconnection Networks , 1998, Lecture Notes in Computer Science.

[14]  Clifford Stein,et al.  Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs ( Extended Abstract ) , 1998 .

[15]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[16]  Clifford Stein,et al.  Improved approximation algorithms for unsplittable flow problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[17]  Aravind Srinivasan,et al.  Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[18]  Stavros G. Kolliopoulos.  Improved Approximation Algorithms for Unsplittable Ow Problems , 1997 .

[19]  Ronitt Rubinfeld,et al.  Short paths in expander graphs , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[20]  Jon M. Kleinberg,et al.  Approximation algorithms for disjoint paths problems , 1996 .

[21]  Éva Tardos,et al.  Disjoint paths in densely embedded graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[22]  Yossi Azar,et al.  Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[23]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[24]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[25]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..