Improved Approximations for Weighted and Unweighted Graph Problems

Authors:
Marc Demange;Vangelis Paschos
Affiliations:
Department of Decision and Information Sciences, ESSEC, France;LAMSADE, Université Paris-Dauphine, Place du Maréchal de Lattre de Tassigny, 75775 Paris Cedex 16, France
Venue:
Theory of Computing Systems
Year:
2005

Citing 0
Cited 3

Approximation algorithms for the weighted independent set problem in sparse graphs

Discrete Applied Mathematics
Approximation of min coloring by moderately exponential algorithms

Information Processing Letters
On-line computation and maximum-weighted hereditary subgraph problems

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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).