Efficient approximation of min set cover by moderately exponential algorithms

Theoretical Computer Science

Volumn 410, Issue 21-23, 2009, Pages 2184-2195

  Bourgeois, N ^a   Escoffier, B ^a   Paschos, V Th ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Approximation algorithms; Exponential algorithms; min set cover

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION;

EXACT COMPUTATIONS; EXPONENTIAL ALGORITHMS; NON-TRIVIAL; POLYNOMIAL-TIME; SET COVER; SUPER-POLYNOMIALS; UPPER BOUND; WORST-CASE COMPLEXITY;

APPROXIMATION ALGORITHMS;

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

References (30)

1. Arora S., Lund C., Motwani R., Sudan M., and Szegedy M. Proof verification and intractability of approximation problems. J. Assoc. Comput. Mach. 45 3 (1998) 501-555
2. Bazgan C., Escoffier B., and Th. Paschos V. Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness. Theoret. Comput. Sci. 339 (2005) 272-292
3. Bazgan C., Monnot J., Th. Paschos V., and Serrière F. On the differential approximation of min set cover. Theoret. Comput. Sci. 332 (2005) 497-513
4. n). J. Algorithms 54 2 (2005) 168-204
5. Berge C. Graphs and Hypergraphs (1973), North Holland, Amsterdam
6. A. Björklund, T. Husfeldt, M. Koivisto, Set partitioning via inclusion-exclusion, SIAM J. Comput., special issue dedicated to selected papers from FOCS'06 (in press)
7. N. Bourgeois, B. Escoffier, V. Th. Paschos, Efficient approximation by low-complexity exponential algorithms, Cahier du LAMSADE 271, LAMSADE, Université Paris-Dauphine, December 2007
8. Cai L., and Huang X. Fixed-parameter approximation: Conceptual framework and approximability results. In: Bodlaender H.L., and Langston M.A. (Eds). Proc. International Workshop on Parameterized and Exact Computation. IWPEC '06. Lecture Notes in Comput. Sci. vol. 4169 (2006), Springer-Verlag 96-108
9. Chen Y., Grohe M., and Grüber M. On parameterized approximability. In: Bodlaender H.L., and Langston M.A. (Eds). Proc. International Workshop on Parameterized and Exact Computation. IWPEC '06. Lecture Notes in Comput. Sci. vol. 4169 (2006), Springer-Verlag 109-120
10. Chvátal V. A greedy-heuristic for the set covering problem. Math. Oper. Res. 4 (1979) 233-235
11. Demange M., Grisoni P., and Th. Paschos V. Differential approximation algorithms for some combinatorial optimization problems. Theoret. Comput. Sci. 209 (1998) 107-122
12. Demange M., and Th. Paschos V. On an approximation measure founded on the links between optimization and polynomial approximation theory. Theoret. Comput. Sci. 158 (1996) 117-141
13. Downey R.G., Fellows M.R., and McCartin C. Parameterized approximation problems. In: Bodlaender H.L., and Langston M.A. (Eds). Proc. International Workshop on Parameterized and Exact Computation. IWPEC '06. Lecture Notes in Comput. Sci. vol. 4169 (2006), Springer-Verlag 121-129
14. R. Duh, M. Fürer, Approximation of k-set cover by semi-local optimization, in: Proc. STOC'97, 1997, pp. 256-265
15. Feige U. A threshold of ln n for approximating set cover. J. Assoc. Comput. Mach. 45 (1998) 634-652
16. Fomin F.V., Grandoni F., and Kratsch D. Some new techniques in design and analysis of exact (exponential) algorithms. Bull. Eur. Assoc. Theor. Comput. Sci. 87 (2005) 47-77
17. Goldsmidt O., Hochbaum D.S., and Yu G. A modified greedy heuristic for the set covering problem with improved worst case bound. Inform. Process. Lett. 48 (1993) 305-310
18. Grandoni F. A note on the complexity of minimum dominating set. J. Discrete Algorithms 4 2 (2006) 209-214
19. Hassin R., and Khuller S. z-approximations. J. Algorithms 41 (2001) 429-442
20. Hochbaum D.S. Approximation algorithms for the set covering and vertex cover problems. SIAM J. Comput. 11 3 (1982) 555-556
21. Johnson D.S. Approximation algorithms for combinatorial problems. J. Comput. System Sci. 9 (1974) 256-278
22. Karp R.M. Reducibility among combinatorial problems. In: Miller R.E., and Thatcher J.W. (Eds). Complexity of Computer Computations (1972), Plenum Press, New York 85-103
23. Khot S., and Regev O. Vertex cover might be hard to approximate to within 2 - ε. J. Comput. System Sci. 74 3 (2008) 335-349
24. Lovász L. On the ratio of optimal integral and fractional covers. Discrete Math. 13 (1975) 383-390
25. Paz A., and Moran S. Non deterministic polynomial optimization problems and their approximations. Theoret. Comput. Sci. 15 (1981) 251-277
26. Schöning U. Algorithmics in exponential time. In: Diekert V., and Durand B. (Eds). Proc. Symposium on Theoretical Aspects of Computer Science. STACS '05. Lecture Notes in Comput. Sci. vol. 3404 (2005), Springer-Verlag 36-43
27. P. Slavík, A tight analysis of the greedy algorithm for set cover, in: Proc. STOC' 96, 1996, pp. 435-441
28. van Rooij J.M.M., and Bodlaender H.L. Design by measure and conquer, a faster exact algorithm for dominating set. In: Albers S., and Weil P. (Eds). Proc. International Symposium on Theoretical Aspects of Computer Science. STACS'08 (2008), Internationales Begegnungs- und Forschungszentrum f"ur Informatik (IBFI), Schloss Dagstuhl, Germany 657-668. http://drops.dagstuhl.de/opus/volltexte/2008/1329 Available at: http://drops.dagstuhl.de/opus/volltexte/2008/1329
29. V. Vassilevska, R. Williams, S.L.M. Woo, Confronting hardness using a hybrid approach, in: Proc. Symposium on Discrete Algorithms, SODA'06, 2006, pp. 1-10
30. Woeginger G.J. Exact algorithms for NP-hard problems: A survey. In: Juenger M., Reinelt G., and Rinaldi G. (Eds). Combinatorial Optimization - Eureka! You Shrink!. Lecture Notes in Comput. Sci. vol. 2570 (2003), Springer-Verlag 185-207