Faster and simpler approximation algorithms for mixed packing and covering problems

Theoretical Computer Science

Volumn 377, Issue 1-3, 2007, Pages 181-204

  Diedrich, Florian ^a   Jansen, Klaus ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

Approximation algorithm; Lagrangian decomposition; Linear and convex programming; Logarithmic potential; Optimization; Packing and covering problem

Indexed keywords

FUNCTION EVALUATION; LAGRANGE MULTIPLIERS; LINEAR PROGRAMMING; OPTIMIZATION; VECTORS;

BLOCK SOLVERS; CONVEX PROGRAMMING; FRACTIONAL PACKING AND COVERING;

APPROXIMATION ALGORITHMS;

EID: 34247571303     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.02.064     Document Type: Article

References (32)

1. Aizatulin M., Diedrich F., and Jansen K. Implementation of approximation algorithms for the max-min resource sharing problem. Experimental Algorithms, Proceedings of the 5th International Workshop on Experimental Algorithms. WEA 2006. LNCS vol. 4007 (2006), Springer 207-218
2. F. Baille, E. Bampis, C. Laforest, Bicriteria scheduling of parallel degradable tasks for network access under pricing constraints, in: Proceedings of International Network Optimization Conference, INOC 2003, pp. 37-42
3. Baille F., Bampis E., and Laforest C. Maximization of the size and the weight of schedules of degradable intervals. Proceedings of 10th International Computing and Combinatorics Conference. COCOON 2004. LNCS vol. 3106 (2004) 219-228
4. * (1 / ε{lunate}) iterations, in: Proceedings of the 36th ACM Symposium on Theory of Computing, STOC 2004, pp. 146-155
5. Błażewicz J., Cellary W., Slowinski R., and We{ogonek}glarz J. Scheduling under resource constraints - deterministic models. Annals of Operations Research 7 (1986)
6. Caragiannis I., Ferreira A., Kaklamanis C., Perennes S., and Rivano H. Fractional path coloring with applications to WDM networks. Proceedings 28th International Colloquium on Automata, Languages, and Programming. ICALP 2001. LNCS vol. 2076 (2001) 732-743
7. R.D. Carr, L. Fleischer, V.J. Leung, C.A. Phillips, Strengthening integrality gaps for capacitated network design and covering problems, in: Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, SODA 2000, pp. 106-115
8. M. Charikar, C. Chekuri, A. Goel, S. Guha, S. Plotkin, Approximating a finite metric by a small number of tree metrics, in: Proceedings 39th IEEE Symposium on Foundations of Computer Science, FOCS 1998, pp. 379-388
9. Chudak F.A., and Eleutério V. Improved approximation schemes for linear programming relaxations of combinatorial optimization problems. Integer Programming and Combinatorial Optimization, Proceedings of the 11th International IPCO Conference. IPCO 2005. LNCS vol. 3509 (2005), Springer 81-96
10. F. Diedrich, K. Jansen, An approximation algorithm for the general mixed packing and covering problem, in: Proceedings of ESCAPE, Hangzhou, China, April 07-09, in: LNCS, Springer, 2007 (in press)
11. L. Fleischer, A fast approximation scheme for fractional covering problems with variable upper bounds, in: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, pp. 1001-1010
12. N. Garg, R. Khandekar, 2004 (Personal communication)
13. N. Garg, J. Könemann, 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 1998, pp. 300-309
14. Grigoriadis M.D., and Khachiyan L.G. Fast approximation schemes for convex programs with many blocks and coupling constraints. SIAM Journal on Optimization 4 (1994) 86-107
15. Grigoriadis M.D., and Khachiyan L.G. Coordination complexity of parallel price-directive decomposition. Mathematics of Operations Research 2 (1996) 321-340
16. Grigoriadis M.D., Khachiyan L.G., Porkolab L., and Villavicencio J. Approximate max-min resource sharing for structured concave optimization. SIAM Journal on Optimization 41 (2001) 1081-1091
17. Jansen K., and Porkolab L. On preemptive resource constrained scheduling: polynomial time approximation schemes. Proceedings of the 9th International Conference on Integer Programming and Combinatorial Optimization. IPCO 2002. LNCS vol. 2337 (2002), Springer 329-349
18. Jansen K., and Porkolab L. On preemptive resource constrained scheduling: polynomial time approximation schemes. SIAM Journal on Discrete Mathematics 20 (2006) 545-563
19. Jansen K. Approximation algorithms for min-max and max-min resource sharing problems and applications. Efficient Approximation and Online Algorithms. LNCS vol. 3484 (2006), Springer 156-202
20. Jansen K. Approximation algorithm for the general max-min resource sharing problem. Algorithm Theory, Proceedings 9th Scandinavian Workshop on Algorithm Theory. SWAT 2004. LNCS vol. 3111 (2004), Springer 311-322
21. Jansen K. Approximation algorithm for the general max-min resource sharing problem. Mathematical Programming Series A 106 (2006) 547-566 Springer
22. Jansen K. Approximation algorithm for the mixed fractional packing and covering problem. Proceedings of 3rd IFIP Conference on Theoretical Computer Science. IFIP TCS 2004 (2004), Kluwer 223-236
23. Jansen K. Approximation algorithm for the mixed fractional packing and covering problem. SIAM Journal on Optimization 17 (2006) 331-352
24. Jansen K., and Zhang H. Approximation algorithms for general packing problems with modified logarithmic potential function. Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science. TCS 2002. Foundations of Information Technology in the Era of Network and Mobile Computing (2002), Kluwer 255-266
25. Kenyon C., and Rémila E. Approximate strip packing. Mathematics of Operations Research 25 (2000) 646-656
26. R. Khandekar, Lagrangian relaxation based algorithms for convex programming problems, Ph.D. Thesis, Indian Institute of Technology, New Delhi, 2004
27. J. Könemann, Fast combinatorial algorithms for packing and covering problems, Diploma Thesis, Max Planck Institute for Computer Science Saarbrücken, 2000
28. Lu Q., and Zhang H. Implementation of approximation algorithms for the multicast congestion problem. Experimental and Efficient Algorithms, Proceedings of the 4th International Workshop on Efficient and Experimental Algorithms. WEA 2005. LNCS vol. 3503 (2005), Springer 152-164
29. Plotkin S.A., Shmoys D.B., and Tardos É. Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research 20 (1995) 257-301
30. J. Villavicencio, M.D. Grigoriadis, Approximate Lagrangian decomposition with a modified Karmarkar logarithmic potential, Network Optimization, in: Lecture Notes in Economics and Mathematical Systems, vol. 450, 1997, pp. 471-485
31. N.E. Young, Randomized rounding without solving the linear program, in: Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, SODA 1995, pp. 170-178
32. N.E. Young, Sequential and parallel algorithms for mixed packing and covering, in: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2001, pp. 538-546