Exponential-time approximation of weighted set cover

Information Processing Letters

Volumn 109, Issue 16, 2009, Pages 957-961

  Cygan, Marek ^a   Kowalik, Łukasz ^a   Wykurz, Mateusz ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

Approximation algorithms; Exponential time algorithms; Instance reduction; Set cover; Trade off

Indexed keywords

APPROXIMATION FACTOR; APPROXIMATION SCHEME; COMPLEXITY ASSUMPTIONS; CONSTANT FACTOR APPROXIMATION; CONSTANT FACTORS; EXACT ALGORITHMS; EXPONENTIAL-TIME ALGORITHMS; FIXED PARAMETERS; HARD PROBLEMS; INSTANCE REDUCTION; NP-HARD PROBLEM; POLYNOMIAL-TIME; REDUCTION RATE; RUNNING-IN; SET COVER PROBLEM; SET-COVER; TIME COMPLEXITY; TRADE-OFF; WEIGHTED SET;

COMMERCE; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; SET THEORY;

APPROXIMATION ALGORITHMS;

EID: 67649313502     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2009.05.003     Document Type: Article

References (18)

1. A. Björklund, T. Husfeldt, Exact algorithms for exact satisfiability and number of perfect matchings, in: Proc. ICALP'06, 2006, pp. 548-559
2. A. Björklund, T. Husfeldt, Inclusion-exclusion algorithms for counting set partitions, in: Proc. FOCS'06, 2006, pp. 575-582
3. A. Björklund, T. Husfeldt, M. Koivisto, Set partitioning via inclusion-exclusion, SIAM J. Comput., Special Issue for FOCS 2006, in press
4. N. Bourjeois, B. Escoffier, V.T. Paschos, Efficient approximation by "low-complexity" exponential algorithms, Technical Report 271, LAMSADE, Université Paris Dauphine, 2008
5. Bourgeois N., Escoffier B., and Paschos V.T. Efficient approximation of Min Set Cover by moderately exponential algorithms. Theor. Comput. Sci. 410 21-23 (2009) 2184-2195
6. J. Chen, I.A. Kanj, G. Xia, Improved parameterized upper bounds for vertex cover, in: Proc. MFCS'06, 2006, pp. 238-249
7. Cygan M., Kowalik L., Pilipczuk M., and Wykurz M. Exponential-time approximation of hard problems. arXiv:0810.4934
8. Dantsin E., Gavrilovich M., Hirsch E.A., and Konev B. MAX SAT approximation beyond the limits of polynomial-time approximation. Ann. Pure Appl. Logic 113 1-3 (2001) 81-94
9. Downey R.G., and Fellows M.R. Parameterized Complexity (1999), Springer
10. Feige U. A threshold of ln n for approximating set cover. J. ACM 45 4 (1998) 634-652
11. Feige U., and Kilian J. Zero knowledge and the chromatic number. J. Comput. System Sci. 57 2 (1998) 187-199
12. 0.288 n) independent set algorithm, in: Proc. SODA'06, 2006, pp. 18-25
13. Gurevich Y., and Shelah S. Expected computation time for hamiltonian path problem. SIAM J. Comput. 16 3 (1987) 486-502
14. 1 - ε{lunate}. Acta Math. 182 1 (1999) 105-142
15. Ibarra O.H., and Kim C.E. Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM 22 4 (1975) 463-468
16. Marx D. Parameterized complexity and approximation algorithms. Computer J. 51 1 (2008) 60-78
17. V. Vassilevska, R. Williams, S.L.M. Woo, Confronting hardness using a hybrid approach, in: Proc. SODA'06, 2006, pp. 1-10
18. Vazirani V.V. Approximation Algorithms (2001), Springer