The maximum saving partition problem

Refael Hassin (1) , Jérôme Monnot (2)

1 TAU - Department of Statistics and Operations Research [Tel Aviv]
2 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision

The input to the MAXIMUM SAVING PARTITION PROBLEM consists of a set V= 1,...,n , weights wi, a function f, and a family S of feasible subsets of V. The output is a partition (S1,...,Sl) such that SiS, and is maximized. We present a general -approximation algorithm, and improved algorithms for special cases of the function f.

Mots clés: Partitioning; Color saving; Approximation algorithms; NP-complete

Domaines: Mathématique discrète [cs.DM]

Refael Hassin, Jérôme Monnot. The maximum saving partition problem. Operations Research Letters, 2005, 33, pp.242-248. ⟨hal-00004034⟩