The maximum saving partition problem

Refael Hassin, Jérôme Monnot*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

The input to the MAXIMUM SAVING PARTITION PROBLEM consists of a set V = [1,..., n], weights wi, a function f, and a family script l sign of feasible subsets of V. The output is a partition (S1,..., S l) such that Si ∈ script l sign, and ∑j∈vwj - ∑ f(Si) is maximized. We present a general 1/2-approximation algorithm, and improved algorithms for special cases of the function f.

Original languageEnglish
Pages (from-to)242-248
Number of pages7
JournalOperations Research Letters
Volume33
Issue number3
DOIs
StatePublished - May 2005

Keywords

  • Approximation algorithms
  • Color saving
  • NP-complete
  • Partitioning

Fingerprint

Dive into the research topics of 'The maximum saving partition problem'. Together they form a unique fingerprint.

Cite this