Approximation algorithms for general packing problems and their application to the multicast congestion problem

Mathematical Programming

Volumn 114, Issue 1, 2008, Pages 183-206

  Jansen, Klaus ^a   Zhang, Hu ^b  

^a UNIVERSITY OF KIEL   (Germany)

^b MCMASTER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); MULTICASTING; PROBLEM SOLVING; SET THEORY;

CONVEX CONSTRAINTS; LAGRANGIAN DECOMPOSITION; MULTICAST COMMUNICATION NETWORK; STEINER TREE PROBLEM;

APPROXIMATION ALGORITHMS;

EID: 41149168156     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-007-0106-8     Document Type: Article

References (41)

1. Arora S., Lund C., Motwani R., Sudan M. and Szegedy M. (1998). Proof verification and hardness of approximation problems. J. Assoc. Comput. Mach. 45: 501-555
2. Baltz, A., Srivastav, A.: Fast approximation of multicast congestion, Manuscript (2001)
3. Baltz A. and Srivastav A. (2004). Fast approximation of minimum multicast congestion-implementation versus theory. RAIRO Oper. Res. 38: 319-344
4. Bern M. and Plassmann P. (1989). The Steiner problem with edge lengths 1 and 2. Inf. Process. Lett. 32: 171-176
5. Burden R.L. and Faires J.D. (1997). Numerical analysis, 6th edn. Brooks/Cole publishing company, Baltimore/Three Lakes
6. Carr, R., Vempala, S.: Randomized meta-rounding. In: Proceedings of the 32nd ACM Symposium on the Theory of Computing, STOC, pp 58-62 (2000)
7. Charikar, M., Chekuri, C., Goel, A., Guha, S., Plotkin, S.: Approximating a finite metric by a small number of tree metrics. In: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, FOCS, pp 379-388(1998)
8. Chlebí k, M., Chlebí ková, J.: Approximation hardness of the Steiner tree problem. In: Proceedings of the 8th Scandinavian Workshop on Algorithm Theory, SWAT, LNCS, vol. 2368, pp 170-179 (2002)
9. Chlebí ková J., Ye D. and Zhang H. (2006). Assign ranges in general ad-hoc networks. J. Parallel Distrib. Comput. 66(4): 489-498
10. Even G., Naor J.S., Rao S. and Schieber B. (1999). Fast approximate graph partitioning algorithms. SIAM J. Comput. 6: 2187-2214
11. Fleischer, L.: A fast approximation scheme for fractional covering problems with variable upper bounds. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms, SODA, pp 994-1003 (2004)
12. Garg, N., Khandekar, R.: Fractional covering with upper bounds on the variables: solving LPs with negative entries. In: Proceedings of the 12th Annual European Symposium on Algorithms, ESA, LNCS, vol. 3221, pp 371-382 (2004)
13. Garg, N., Könemann, J.: Fast and simpler algorithms for multicommodity flow and other fractional packing problems. In: Proceedings of the 39th IEEE Annual Symposium on Foundations of Computer Science, FOCS, pp 300-309 (1998)
14. Grigoriadis M.D. and Khachiyan L.G. (1994). Fast approximation schemes for convex programs with many blocks and coupling constraints. SIAM J. Optim. 4: 86-107
15. Grigoriadis M.D. and Khachiyan L.G. (1996). Coordination complexity of parallel price-directive decomposition. Math. Oper. Res. 2: 321-340
16. -2 knm) time. Math. Programm. 75: 477-482
17. Grigoriadis M.D., Khachiyan L.G., Porkolab L. and Villavicencio J. (2001). Approximate max-min resource sharing for structured concave optimization. SIAM J. Optim. 11: 1081-1091
18. Grötschel M., Lovász L. and Schrijver A. (1988). Geometric Algorithms and Combinatorial Optimization. Springer, Berlin
19. Jansen K. (2003). Approximate strong separation with application in fractional graph coloring and preemptive scheduling. Theor. Comput. Sci. 302: 239-256
20. Jansen K. (2006). An approximation algorithm for the general max-min resource sharing problem. Math. 106(3): 547-566
21. Jansen K. (2006). Approximation algorithm for the mixed fractional packing and covering problem. SIAM. J. Optim. 17: 331-352
22. Diedrich, F., Jansen, K., Faster and simpler approximation algorithms for mixed packing and covering problems, to appear in Theoretical Computer Science.
23. Jansen K. and Porkolab L. (2001). Improved approximation schemes for scheduling unrelated parallel machines. Math. Oper. Res. 26: 324-338
24. Jansen K. and Porkolab L. (2006). On preemptive resource constrained scheduling: polynomial time schemes. SIAM. J. Discrete. Math. 20: 545-563
25. Jansen K. and Solis-Oba R. (2003). An asymptotic fully polynomial time approximation scheme for bin covering. Theor. Comput. Sci. 306: 543-551
26. Karp R.M. (1972). Reducibility among combinatorial problems. In: Miller, R.E. and Thatcher, J.W. (eds) Complexity of Computer Computations, pp 85-103. Plenum Press, New York
27. Klein P., Plotkin S., Stein C. and Tardos E. (1994). Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. SIAM J. Comput. 23: 466-487
28. Lenstra J.K., Shmoys D.B. and Tardos E. (1990). Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 24: 259-272
29. Lu, Q., Zhang, H.: Implementation of approximation algorithms for the multicast congestion problem. In: Proceedings of the 4th International Workshop on Efficient and Experimental Algorithms, WEA, LNCS, vol. 3503, pp 152-164 (2005)
30. Plotkin S.A., Shmoys D.B. and Tardos E. (1995). Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res. 2: 257-301
31. Radzik T. (1997). Fast deterministic approximation for the multicommodity flow problem. Math. Program. 78: 43-58
32. Raghavan P. (1988). Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. Comput. Syst. Sci. 37: 130-143
33. Raghavan P. and Thompson C. (1987). Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7: 365-374
34. Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp 770-779 (2000)
35. Terlaky, T., Vannelli, A., Zhang, H.: On routing in VLSI design and communication networks. In: Proceedings of the 16th Annual International Symposium on Algorithms and Computation, ISAAC, LNCS, vol. 3827, pp 1051-1060 (2005)
36. Vempala, S., Vöcking, B.: Approximating multicast congestion. In: Proceedings of the tenth International Symposium on Algorithms and Computation, ISAAC, LNCS, vol. 1741, pp 367-372 (1999)
37. Villavicencio J. and Grigoriadis M.D. (1996). Approximate structured optimization by cyclic block-coordinate descent. In: Ritter, K., Fischer, H., Riedmüller, B. and Schäffler, S. (eds) Applied Mathematics and Parallel Computing-Festschrift, pp 359-371. Physica-Verlag, Heidelberg
38. Villavicencio J. and Grigoriadis M.D. (1997). Approximate Lagrangian decomposition with a modified Karmarkar logarithmic potential. In: Pardalos, P., Hearn, D.W. and Hager, W.W. (eds) Network Optimization. Lecture Notes in Economics and Mathematical Systems, vol. 450, pp 471-485. Springer, Berlin
39. Ye, D., Zhang, H.: The range assignment problem in static ad-hoc networks on metric spaces. In: Proceedings of the 11th Colloquium on Structural Information and Communication Complexity, SIROCCO, LNCS, vol. 3104, pp 291-302 (2004)
40. Young, N.E.: Randomized rounding without solving the linear program. In: Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, SODA, pp 170-178 (1995)
41. Young, N.E.: Sequential and parallel algorithms for mixed packing and covering. In: Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, FOCS, pp 538-546 (2001)