Approximating min-sum set cover

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

Volumn 2462, Issue , 2002, Pages 94-108

  Feige, Uriel ^a   Lovász, László ^b   Tetali, Prasad ^c  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b MICROSOFT RESEARCH   (United States)

^c Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION;

APPROXIMATION RATIOS; CHROMATIC SUM; GREEDY ALGORITHMS; LINEAR ARRANGEMENTS; LINEAR ORDER; SET COVER; SET COVER PROBLEM; VERTEX COVER;

APPROXIMATION ALGORITHMS;

EID: 84957005442     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45753-4_10     Document Type: Conference Paper

References (9)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy. “Proof verification and the hardness of approximation problems”. JACM45(3):501–555, 1998.
2. A. Bar-Noy, M. Bellare, M. Halldorsson, H. Shachnai, T. Tamir. “On chromatic sums and distributed resource allocation.” Information and Computation, 140:183–202, 1998.
3. A. Bar-Noy, M. Halldorsson, G. Kortsarz. “A matched approximation bound for the sum of a greedy coloring”. Information Processing Letters, 1999.
4. S. Burer and R. Monteiro. “A projected gradient algorithm for solving the maxcut SDP relaxation”. Optimization Methods and Software, 15 (2001) 175-200.
5. U. Feige. “A threshold of ln n for approximating set cover”. Journal of the ACM, 45(4), 634–652, 1998.
6. U. Feige, M. Halldorsson, G. Kortsarz, A. Srinivasan. “Approximating the domatic number”. Preliminary version in STOC 2000.
7. U. Feige and J. Kilian. “Zero knowledge and the chromatic number”. Journal of Computer and System Sciences, 57(2):187–199, 1998.
8. U. Feige and M. Langberg. “Approximation algorithms for maximization problems arising in graph partitioning”. Journal of Algorithms41, 174–211 (2001).
9. E. Halperin and U. Zwick. “A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems”. In proceedings of IPCO, 2001.