Approximation Algorithms for the Unsplittable Flow Problem

Algorithmica ◽

10.1007/s00453-006-1210-5 ◽

2006 ◽

Vol 47 (1) ◽

pp. 53-78 ◽

Author(s):

Amit Chakrabarti ◽

Chandra Chekuri ◽

Anupam Gupta ◽

Amit Kumar

Keyword(s):

Approximation Algorithms ◽

Flow Problem ◽

Unsplittable Flow

Download Full-text

Approximation Algorithms for the Unsplittable Flow Problem

Approximation Algorithms for Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/3-540-45753-4_7 ◽

2002 ◽

pp. 51-66 ◽

Author(s):

Amit Chakrabarti ◽

Chandra Chekuri ◽

Anuptam Gupta ◽

Amit Kumar

Keyword(s):

Approximation Algorithms ◽

Flow Problem ◽

Unsplittable Flow

Download Full-text

Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem

Experimental and Efficient Algorithms - Lecture Notes in Computer Science ◽

10.1007/978-3-540-24838-5_16 ◽

2004 ◽

pp. 213-227

Author(s):

Jingde Du ◽

Stavros G. Kolliopoulos

Keyword(s):

Approximation Algorithms ◽

Flow Problem ◽

Single Source ◽

Unsplittable Flow

Download Full-text

Implementing approximation algorithms for the single-source unsplittable flow problem

Journal of Experimental Algorithmics ◽

10.1145/1064546.1180614 ◽

2005 ◽

Vol 10 ◽

Author(s):

Jingde Du ◽

Stavros G. Kolliopoulos

Keyword(s):

Approximation Algorithms ◽

Flow Problem ◽

Single Source ◽

Unsplittable Flow

Download Full-text

An efficient binary-search based heuristic for extended Unsplittable Flow Problem

2017 International Conference on Computing, Networking and Communications (ICNC) ◽

10.1109/iccnc.2017.7876239 ◽

2017 ◽

Author(s):

Erdal Akin ◽

Turgay Korkmaz

Keyword(s):

Flow Problem ◽

Binary Search ◽

Unsplittable Flow

Download Full-text

Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow

Lecture Notes in Computer Science - Efficient Approximation and Online Algorithms ◽

10.1007/11671541_4 ◽

2006 ◽

pp. 97-134 ◽

Author(s):

Thomas Erlebach

Keyword(s):

Approximation Algorithms ◽

Disjoint Paths ◽

Edge Disjoint ◽

Unsplittable Flow

Download Full-text

Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/3-540-48777-8_25 ◽

1999 ◽

pp. 328-344 ◽

Author(s):

Stavros G. Kolliopoulos ◽

Clifford Stein

Keyword(s):

Approximation Algorithms ◽

Experimental Evaluation ◽

Single Source ◽

Unsplittable Flow

Download Full-text

Approximation Algorithms for the Maximum Concurrent Flow Problem

INFORMS Journal on Computing ◽

10.1287/ijoc.1.2.62 ◽

1989 ◽

Vol 1 (2) ◽

pp. 62-69 ◽

Author(s):

Farhad Shahrokhi

Keyword(s):

Approximation Algorithms ◽

Flow Problem ◽

Concurrent Flow ◽

Maximum Concurrent Flow

Download Full-text

Improved bounds for the unsplittable flow problem

Journal of Algorithms ◽

10.1016/j.jalgor.2004.07.006 ◽

2006 ◽

Vol 61 (1) ◽

pp. 20-44 ◽

Author(s):

Petr Kolman ◽

Christian Scheideler

Keyword(s):

Flow Problem ◽

Unsplittable Flow

Download Full-text

On the single-source unsplittable flow problem

Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) ◽

10.1109/sfcs.1998.743461 ◽

2002 ◽

Author(s):

Y. Dinitz ◽

N. Garg ◽

M.X. Goemans

Keyword(s):

Flow Problem ◽

Single Source ◽

Unsplittable Flow

Download Full-text

Improved approximation algorithms for unsplittable flow problems

Proceedings 38th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1997.646131 ◽

2002 ◽

Author(s):

S.G. Kolliopoulos ◽

C. Stein

Keyword(s):

Approximation Algorithms ◽

Flow Problems ◽

Unsplittable Flow

Download Full-text