Unsplittable flow in paths and trees and column-restricted packing integer programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5687 LNCS, Issue , 2009, Pages 42-55

  Chekuri, Chandra ^a   Ene, Alina ^a   Korula, Nitish ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EDGE CAPACITY; GENERAL GRAPH; GRAPH G; INTEGRALITY GAPS; LP RELAXATION; MAXIMUM DEMAND; NON-TRIVIAL; PACKING INTEGER PROGRAMS; SOURCE-DESTINATION PAIRS; UNSPLITTABLE FLOW;

COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING; TECHNICAL PRESENTATIONS;

APPROXIMATION ALGORITHMS;

EID: 70350614880     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03685-9_4     Document Type: Conference Paper

References (33)

1. Andrews, M., Chuzhoy, J., Khanna, S., Zhang, L.: Hardness of the undirected edge-disjoint paths problem with congestion. In: Proc. of IEEE FOCS, pp. 226-241 (2005)
2. Azar, Y., Regev, O.: Combinatorial algorithms for the unsplittable flow problem. Algorithmica 441(1), 49-66 (2006)
3. Bansal, N., Friggstad, Z., Khandekar, R., Salavatipour, M.R.: A logarithmic approximation for unsplittable flow on line graphs. In: Proc. of ACM-SIAM SODA, pp. 702-709 (2009)
4. Bansal, N., Chakrabarti, A., Epstein, A., Schieber, B.: A Quasi-PTAS for unsplit-table flow on line graphs. In: Proc. of ACM STOC, pp. 721-729 (2006)
5. Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Schieber, B.: A unified approach to approximating resource allocation and scheduling. JACM 48(5), 1069-1090 (2001)
6. Bar-Noy, A., Guha, S., Naor, J., Schieber, B.: Approximating the Throughput of Multiple Machines in Real-Time Scheduling. SICOMP 31(2), 331-352 (2001)
7. Baveja, A., Srinivasan, A.: Approximation algorithms for disjoint paths and related routing and packing problems. Math. Oper. Res. 25(2), 255-280 (2000)
8. Bienstock, D.: Approximate formulations for 0-1 knapsack sets. Oper. Res. Lett. 36(3), 317-320 (2008)
9. Calinescu, G., Chakrabarti, A., Karloff, H., Rabani, Y.: Improved approximation algorithms for resource allocation. In: Proc. of IPCO, pp. 439-456 (2001)
10. Carr, R.D., Fleischer, L., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: Proc. of ACMSIAM SODA, pp. 106-115 (2000)
11. Carr, R., Vempala, S.: Randomized meta-rounding. Random Structures and Algorithms 20(3), 343-352 (2002)
12. Chakrabarti, A., Chekuri, C., Gupta, A., Kumar, A.: Approximation Algorithms for the Unsplittable Flow Problem. Algorithmica 47(1), 53-78 (2007)
13. Chekuri, C., Khanna, S., Shepherd, F.B.: An O(√n) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow. Theory of Computing 2, 137-146 (2006)
14. Chekuri, C., Khanna, S., Shepherd, F.B.: Edge-Disjoint Paths in Planar Graphs with Constant Congestion. In: Proc. of ACM STOC, pp. 757-766 (2006)
15. Chekuri, C., Mydlarz, M., Shepherd, F.B.: Multicommodity Demand Flow in a Tree and Packing Integer Programs. ACM Trans. on Algorithms 3(3) (2007)
16. Chuzhoy, J., Guruswami, V., Khanna, S., Talwar, K.: Hardness of Routing with Congestion in Directed Graphs. In: Proc. of ACM STOC, pp. 165-178 (2007)
17. Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18(1), 3-20 (1997)
18. Guruswami, V., Khanna, S., Shepherd, B., Rajaraman, R., Yannakakis, M.: Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems. J. of Computer and System Sciences 67(3), 473-496 (2003)
19. 1-ε. Acta Mathematica 182, 105-142 (1999)
20. Kleinberg, J.M.: Approximation algorithms for disjoint paths problems. PhD thesis, MIT EECS (1996)
21. Kolliopoulos, S.G.: Edge-disjoint Paths and Unsplittable Flow. In: Gonzalez, T.F. (ed.) Handbook of Approximation Algorithms and Metaheuristics. Chapman & Hall/CRC, Boca Raton (2007)
22. Kolliopoulos, S.G., Stein, C.: Approximating disjoint-path problems using greedy algorithms and Packing Integer Programs. Math. Prog. A (99), 63-87 (2004)
23. Kolman, P.: A Note on the Greedy Algorithm for the Unsplittable Flow Problem. Information Processing Letters 88(3), 101-105 (2003)
24. Kolman., P., Scheideler, C.: Improved bounds for the unsplittable flow problem. J. of Algorithms 61(1), 20-44 (2006)
25. Pritchard, D.: Approximability of Sparse Integer Programs. In: Proc. of ESA (to appear, 2009); arXiv.org preprint, arXiv:0904.0859v1, http://arxiv.org/abs/0904.0859
26. Raghavan, P.: Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs. JCSS 37(2), 130-143 (1988)
27. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)
28. Shepherd, B., Vetta, A.: The Demand Matching Problem. Math. of Operations Research 32(3), 563-578 (2007)
29. Sherali, H., Adams, W. P.: A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-Integer Zero-One Programming Problems. Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science 52 (1994)
30. Srinivasan, A.: Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. In: Proc. of IEEE FOCS, pp. 416-425 (1997)
31. Srinivasan, A.: New Approaches to Covering and Packing Problems. In: Proc. of ACM-SIAM SODA, pp. 567-576 (2001)
32. Van Vyve, M., Wolsey, L.A.: Approximate Extended Formulations. Math. Prog. 105, 501-522 (2006)
33. Varadarajan, K., Venkataraman, G.: Graph Decomposition and a Greedy Algorithm for Edge-disjoint Paths. In: Proc. of ACM-SIAM SODA, pp. 379-380 (2004)