Multicommodity demand flow in a tree and packing integer programs

ACM Transactions on Algorithms

Volumn 3, Issue 3, 2007, Pages

  Chekuri, Chandra ^a,d   Mydlarz, Marcelo ^b   Shepherd, F Bruce ^c  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b YAHOO RESEARCH   (United States)

^c MCGILL UNIVERSITY   (Canada)

^d University of Illinois at Urbana Champaign

Author keywords

Approximation algorithm; Integer multicommodity flow; Integrality gap; Packing integer program; Tree

Indexed keywords

APPROXIMATION ALGORITHMS; DECISION TREES; OPTIMIZATION; PATTERN MATCHING; PROBLEM SOLVING;

INTEGER MULTICOMMODITY FLOWS; INTEGRALITY GAPS; PACKING INTEGER PROGRAMS; PRIMAL-DUAL ALGORITHMS;

INTEGER PROGRAMMING;

EID: 34548230391     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1273340.1273343     Document Type: Article

References (25)

1. ANDREWS, M., CHUZHOY, J., KHANNA, S., AND ZHANG, L. 2005. Hardness of the undirected edge-disjoint paths problem with congestion. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science. 226-244.
2. ANDREWS, M., AND ZHANG, L. 2005a. Bounds on fiber minimization in optical networks with fixed fiber capacity. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). 409-419.
3. ANDREWS, M., AND ZHANG, L. 2005b. Hardness of the undirected edge-disjoint paths problem. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing. 276-283.
4. ANDREWS, M., AND ZHANG, L. 2006. Complexity of wavelength assignment in optical network optimization. In Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM).
5. BANSAL, N., CHAKRABARTI, A., EPSTEIN, A., AND SCHIEBER, B. 2006. A quasi-PTAS for unsplittable flow on line graphs. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing. 721-729.
6. BAR-NOY, A., BAR-YEHUDA, R., FREUND, A., NAOR, J., AND SCHIEBER, B. 2001. A unified approach to approximating resource allocation and scheduling. /. ACM 48, 5, 1069-1090.
7. BAUM, S., AND TROTTER. JR., L. E. 1978. Integer rounding and polyhedral, decomposition for totally unimodular systems. In Optimization and Operations Research, R. Henn et al. eds. Lecture Notes in Economics and Mathematics Systems, vol. 157. Springer, 15-23.
8. CAUNESCU, G., CHAKRABARTI, A., KARLOFF, H. J., AND RABANI, Y 2002. Improved approximation algorithms for resource allocation. In Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization (IPCO). Lecture Notes in Computer Science, vol. 2337. Springer, 401-414.
9. CHAKRABARTI, A., CHEKURI, C., GUPTA, A., AND KUMAR, A. 2002. Approximation algorithms for the unsplittable flow problem. In Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX). 51-66.
10. CHEKURI, C., KHANNA, S., AND SHEPHERD, F. B. 2006a. Edge-Disjoint paths in planar graphs with constant congestion. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing. 757-766.
11. CHEKURI, C., KHANNA, S., AND SHEPHERD, F. B. 2006b. An O(√/n) approximation and integrality gap for disjoint paths and unsplittable flow. Theory Comput. 2, 7, 137-146.
12. CHEKURI, C., KHANNA, S., AND SHEPHERD, F. B. 2004. The all-or-nothing multicommodity flow problem. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing. 156-165.
13. CHERIYAN, J., JORDÁN, T., AND RAVI, R. 1999. On 2-coverings and 2-packings of laminar families. In Proceedings of the 7th Annual European Symposium on Algorithms (ESA). 510-520.
14. DINTIZ, Y., GARG, N., AND GOEMANS, M. X. 1999. On the single-source unsplittable flow problem. Combinatorica 19, 1, 17-41.
15. ERLEBACH, T., PAGOURTZIS, A., POTIKA, K., AND STEFANAKOS, S. 2003. Resource allocation problems in multifiber wdm tree networks. In Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG). 218-229.
16. GARG, N., VAZIRANI, V. V., AND YANNAKAKIS, M. 1997. Primal-Dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18, 1, 3-20.
17. GURUSWAMI, V., KHANNA, S., RAJARAMAN, R., SHEPHERD, F. B., AND YANNAKAKIS, M. 2003. NearOptimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J. Comput. Syst. Sci. 67, 3, 473-496.
18. KLEINBERG, J. 1996. Approximation algorithms for disjoint paths problems. Ph.D. thesis, MIT.
19. KOLLIOPOULOS, S. G., AND STEIN, C. 2004. Approximating disjoint-path problems using packing integer programs. Math. Program. Ser. A 99, 1, 63-87.
20. KOLLIOPOULOS, S. G., AND STEIN, C. 2001. Approximation algorithms for single-source unsplittable flow. SIAM J. Comput. 31, 3, 919-946.
21. RAGHAVAN, P., AND UPFAL, E. 1994. Efficient routing in. all-optical networks. In Proceedings of the Annual ACM Symposium on Theory of Computing. 134-143.
22. SCHRIJVER, A. 1986. Theory of Linear and Integer Programming. John Wiley & Sons.
23. SHEPHERD, F. B., AND VETTA, A. 2007. The demand matching problem. Math. Oper. Res. To appear. Preliminary version in Proceedings of the International Conference on Integer Programming and Combinatorial Optimization (IPCO), 2002.
24. SHEPHERD, F. B., AND ZHANG, L. 2001. A cycle augmentation algorithm for minimum, cost multicommodity flows on a ring. Discrete Appl. Math. 110, 2-3, 301-315.
25. WOLSEY, L. 2002. Private communication.