Fractional covering with upper bounds on the variables: Solving lps with negative entries

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

Volumn 3221, Issue , 2004, Pages 371-382

  Garg, Naveen ^a   Khandekar, Rohit ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LINEAR PROGRAMMING;

APPROXIMATE SOLUTION; FRACTIONAL PACKING; LAGRANGIAN RELAXATION TECHNIQUES; LINEAR PROGRAMS; NEGATIVE COEFFICIENTS; NEGATIVE ENTRIES; OBJECTIVE FUNCTIONS; STRONGLY POLYNOMIALS;

C (PROGRAMMING LANGUAGE);

EID: 35048902400     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30140-0_34     Document Type: Article

References (15)

1. Fleischer, L.: A fast approximation scheme for fractional covering problems with variable upper bounds. In: Proceedings, ACM-SIAM Symposium on Discrete Algorithms. (2004) 994-1003
2. Shahrokhi, F., Matula, D.: The maximum concurrent flow problem. J. ACM 37 (1990) 318-334
3. Plotkin, S., Shmoys, D., Tardos, E.: Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res. 20 (1995) 257-301
4. Luby, M., Nisan, N.: A parallel approximation algorithm for positive linear programming. In: Proceedings, ACM Symposium on Theory of Computing. (1993) 448-457
5. Grigoriadis, M., Khachiyan, L.: Fast approximation schemes for convex programs with many blocks and coupling constraints. SIAM J. Optimization 4 (1994) 86-107
6. -2fcnm) time. Math. Programming 75 (1996) 477-482
7. Young, N.: Randomized rounding without solving the linear program. In: Proceedings, ACM-SIAM Symposium on Discrete Algorithms. (1995) 170-178
8. Young, N.: Sequential and parallel algorithms for mixed packing and covering. In: Proceedings, IEEE Symposium on Foundations of Computer Science. (2001) 538-546
9. Garg, N., Könemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In: Proceedings, IEEE Symposium on Foundations of Computer Science. (1998) 300-309
10. Fleischer, L.: Approximating fractional multicommodity flow independent of the number of commodities. SIAM J. Discrete Math. 13 (2000) 505-520
11. Bienstock, D.: Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice. Kluwer Academic Publishers, Boston (2002) An early version also appears as CORE Lecture Series Monograph, Core, UCL, Belgium (2001) (download from www.core.ucl.ac.be).
12. Grigoriadis, M., Khachiyan, L.: Coordination complexity of parallel price-directive decomposition. Math. Oper. Res. 21 (1994) 321-340
13. Jansen, K., Zhang, H.: Approximation algorithms for general packing problems with modified logarithmic potential function. In: Theoret. Comput. Sci. (2002) 255-266
14. Rockafellar, T.: Convex Analysis. Princeton University Press, Princeton, NJ (1970)
15. Khandekar, R.: Lagrangian relaxation based algorithms for convex programming problems. PhD thesis, Indian Institute of Technology Delhi (2004) Available at http://www.cse.iitd.ernet.in/~rohitk.