Approximating min sum set cover

Algorithmica (New York)

Volumn 40, Issue 4, 2004, Pages 219-234

  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

Greedy algorithm; NP hardness; Randomized rounding; Threshhold

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES;

GREEDY ALGORITHM; NP-HARDNESS; RANDOMIZED ROUNDING; THRESHOLD;

SET THEORY;

EID: 21044440739     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-004-1110-5     Document Type: Conference Paper

References (12)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501-555, 1998.
2. A. Bar-Noy, M Bellare, M. Halldorsson, H. Shachnai, and T. Tamir. On chromatic sums and distributed resource allocation. Information and Computation, 140:183-202, 1998.
3. A. Bar-Noy, M Halldorsson, and G. Kortsarz. A matched approximation bound for the sum of a greedy coloring. Information Processing Letters. 11: 135-140, 1999.
4. S. Burer and R. Monteiro. A projected gradient algorithm for solving the maxcut SDP relaxation. Optimization Methods and Software, 15: 175-200, 2001.
5. E. Cohen, A. Fiat, and H. Kaplan. Efficient sequences of trails. In Proceedings of SODA, pp. 737-746, 2003.
6. U. Feige. A threshold of In n for approximating set cover. Journal of the ACM, 45(4): 634-652, 1998.
7. U. Feige, M. Halldorsson, G. Kortsarz, and A. Srinivasan. Approximating the domatic number. Preliminary version in STOC 2000.
8. U. Feige and J. Kilian. Zero knowledge and the chromatic number. Journal of Computer and System Sciences. 57(2):187-199, 1998.
9. U. Feige and M. Langberg. Approximation algorithms for maximization problems arising in graph partitioning. Journal of Algorithms, 41:174-211, 2001.
10. U. Feige, L. Lovasz, and P. Tetali. Approximating min sum set cover. In Proceedings of APPROX, pp. 94-107, 2002.
11. E. Halperin and U. Zwick. A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems. In Proceedings of IPCO, pp. 210-225, 2001.
12. G. Nemhauser and L. Trotter. Vertex packings: structural properties and algorithms. Mathematical Programming, 8:232-248, 1975.