Differential approximation algorithms for some combinatorial optimization problems

Demange, Marc; Grisoni, Pascal; Paschos, Vangelis

Demange, Marc; Grisoni, Pascal; Paschos, Vangelis (1998), Differential approximation algorithms for some combinatorial optimization problems, Theoretical Computer Science, 209, 1-2, p. 107-122. http://dx.doi.org/10.1016/S0304-3975(97)00099-6

Type

Article accepté pour publication ou publié

Date

1998

Nom de la revue

Theoretical Computer Science

Volume

209

Numéro

1-2

Éditeur

Elsevier

Pages

107-122

Résumé (EN)

We use a new approximation measure, the differential approximation ratio, to derive polynomial-time approximation algorithms for minimum set covering (for both weighted and unweighted cases), minimum graph coloring and bin-packing. We also propose differential-approximation-ratio preserving reductions linking minimum coloring, minimum vertex covering by cliques, minimum edge covering by cliques and minimum edge covering of a bipartite graph by complete bipartite graphs.

Mots-clés

Set covering; Bin-packing; Coloring; Polynomial time approximation algorithm; NP-complete problem