Improved approximations for weighted and unweighted graph problems
Demange, Marc; Paschos, Vangelis (2005), Improved approximations for weighted and unweighted graph problems, Theory of Computing Systems, 38, 6, p. 763-787. http://dx.doi.org/10.1007/s00224-004-1162-6
TypeArticle accepté pour publication ou publié
Journal nameTheory of Computing Systems
MetadataShow full item record
Abstract (EN)We obtain improved approximation ratios for problems of a broad class called weighted hereditary induced-subgraph maximization problems, in particular for the maximum independent set, maximum clique and maximum ℓ-colorable induced subgraph, as well as for the minimum coloring problem. We also study the minimum chromatic sum and show that its weighted version polynomially reduces to the weighted independent set problem in such a way that approximation ratios are preserved (up to a multiplicative constant).
Subjects / KeywordsMinimum chromatic sum; Minimum coloring problem; Maximum clique; Maximum independant set
Showing items related by title and author.
A generalization of König-Egervary graphs and heuristics for maximum independent set problem with improved approximation ratios Paschos, Vangelis; Demange, Marc (1997) Article accepté pour publication ou publié
de Werra, Dominique; Demange, Marc; Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis (2004) Communication / Conférence
Paschos, Vangelis; Monnot, Jérôme; Escoffier, Bruno; Demange, Marc; de Werra, Dominique (2009) Article accepté pour publication ou publié