Thumbnail - Request a copy

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

Type
Article accepté pour publication ou publié
Date
2005
Journal name
Theory of Computing Systems
Volume
38
Number
6
Publisher
Springer
Pages
763-787
Publication identifier
Metadata
Show full item record
Author(s)
Demange, Marc
Paschos, Vangelis
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 / Keywords
Minimum chromatic sum; Minimum coloring problem; Maximum clique; Maximum independant set