On the differential approximation of MIN SET COVER

Theoretical Computer Science

Volumn 332, Issue 1-3, 2005, Pages 497-513

  Bazgan, Cristina ^a   Monnot, Jérôme ^a   Paschos, Vangelis Th ^a   Serrière, Fabrice ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Approximation algorithms; Combinatorial problem; Complexity; Greedy algorithm; Set cover

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DIFFERENTIAL EQUATIONS; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY;

APPROXIMATION ALGORITHMS; COMBINATORIAL PROBLEMS; GREEDY ALGORITHMS; SET COVER;

APPROXIMATION THEORY;

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

References (16)

1. A. Aiello, E. Burattini, M. Furnari, A. Massarotti, F. Ventriglia, Computational complexity: the problem of approximation, in: Colloquia Mathematica Societatis János Bolyai (Ed.) Algebra, Combinatorics, and Logic in Computer Science, Vol. I, North-Holland, New York, 1986, pp. 51-62.
2. G. Ausiello, A. D'Atri, and M. Protasi On the structure of combinatorial problems and structure preserving reductions Proc. ICALP'77, Lecture Notes in Computer Science, Springer, Berlin 1977
3. G. Ausiello, A. D'Atri, and M. Protasi Structure preserving reductions among convex optimization problems J. Comput. System Sci. 21 1980 136 153
4. G. Ausiello, A. Marchetti-Spaccamela, and M. Protasi Towards a unified approach for the classification of NP-complete optimization problems Theoret. Comput. Sci. 12 1980 83 96
5. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi Complexity and Approximation Combinatorial Optimization Problems and their Approximability Properties 1999 Springer Berlin
6. M. Demange, and V.Th. Paschos Quelques étapes vers la conciliation de la théorie d'approximation et celle d'optimisation une nouvelle théorie d'approximation polynomiale et résultats préliminaites C.R. Acad. Sci. Paris Sér. I Math. 317 1993 409 414
7. M. Demange, and V.Th. Paschos On an approximation measure founded on the links between optimization and polynomial approximation theory Theoret. Comput. Sci. 158 1996 117 141
8. M. Demange, and V.Th. Paschos Improved approximations for maximum independent set via approximation chains Appl. Math. Lett. 10 3 1997 105 110
9. M. Demange, P. Grisoni, and V.Th. Paschos Differential approximation algorithms for some combinatorial optimization problems Theoret. Comput. Sci. 209 1998 107 122
10. M.M. Halldórsson Approximations of weighted independent set and hereditary subset problems J. Graph Algorithms Appl. 4 1 2000 1 16
11. R. Hassin, and S. Khuller z-approximations J. Algorithms 41 2001 429 442
12. R. Hassin, and J. Monnot The maximum saving partition problem Oper. Res. Lett. 33 2005 242 248
13. D.S. Johnson Approximation algorithms for combinatorial problems J. Comput. System Sci. 9 1974 256 278
14. L. Lovász On the ratio of optimal integral and fractional covers Discrete Math. 13 1975 383 390
15. P. Slavík A tight analysis of the greedy algorithm for set cover Proc. STOC'96 1996 435 441
16. E. Zemel Measuring the quality of approximate solutions to zero-one programming problems Math. Oper. Res. 6 1981 319 332