Thumbnail - Request a copy

A survey of approximately optimal solutions to some covering and packing problems

Paschos, Vangelis (1997), A survey of approximately optimal solutions to some covering and packing problems, ACM Computing Surveys, 29, 2, p. 171-209. http://doi.acm.org/10.1145/254180.254190

Type
Article accepté pour publication ou publié
Date
1997
Nom de la revue
ACM Computing Surveys
Volume
29
Numéro
2
Éditeur
ACM
Pages
171-209
Identifiant publication
Métadonnées
Afficher la notice complète
Auteur(s)
Paschos, Vangelis
Résumé (EN)
We survey approximation algorithms for some well-known and very natural combinatorial optimization problems, the minimum set covering, the minimum vertex covering, the maximum set packing, and maximum independent set problems; we discuss their approximation performance and their complexity. For already known results, any time we have conceived simpler proofs than those already published, we give these proofs, and, for the rest, we cite the simpler published ones. Finally, we discuss how one can relate the approximability behavior (from both a positive and a negative point of view) of vertex covering to the approximability behavior of a restricted class of independent set problems.
Mots-clés
Combinatorial optimization; Approximation algorithms