
Maximum-weight independent set is as "well" approximated as the unweighted one
Demange, Marc; Paschos, Vangelis (1999), Maximum-weight independent set is as "well" approximated as the unweighted one. https://basepub.dauphine.fr/handle/123456789/4759
View/ Open
Type
Document de travail / Working paperDate
1999Publisher
Université Paris-Dauphine
Series title
Cahiers du LAMSADESeries number
163Published in
Paris
Metadata
Show full item recordSubjects / Keywords
l-colorable induced subgraph; chromatic sum; independant set; hereditary problem; NP-completeness; polynomial-time approximation algorithm; computational complexity; combinatorial problems; somme chromatique; graphe induit l-colorable; clique; stable; problème héréditaire; NP-complétude; algorithme polynomial d'approximation; complexité; problèmes combinatoiresRelated items
Showing items related by title and author.
-
Demange, Marc; Paschos, Vangelis (1997) Article accepté pour publication ou publié
-
Paschos, Vangelis (1994) Article accepté pour publication ou publié
-
Demange, Marc; Paschos, Vangelis (1995) Communication / Conférence
-
Demange, Marc; Paschos, Vangelis (1997) Article accepté pour publication ou publié
-
Paschos, Vangelis; Demange, Marc (1997) Article accepté pour publication ou publié