# Themaximumsaving partition problem

@inproceedings{Hassina2004ThemaximumsavingPP, title={Themaximumsaving partition problem}, author={Refael Hassina and J{\'e}r{\^o}me Monnotb}, year={2004} }

- Published 2004

The input to theMAXIMUM SAVING PARTITION PROBLEM consists of a set V = {1, . . . , n}, weightswi , a functionf, and a familyS of feasible subsets of V. The output is a partition(S1, . . . , Sl) such thatSi ∈ S, and ∑ j∈V wj − ∑l i=1 f (Si) is maximized. We present a general 1 2-approximation algorithm, and improved algorithms for special cases of the function f. © 2004 Elsevier B.V. All rights reserved.

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 18 REFERENCES

## J

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL

## Three-Quarter Approximation for the Number of Unused Colors in Graph Coloring

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## A hypocoloring model for batch scheduling

VIEW 1 EXCERPT

## S

VIEW 1 EXCERPT

## Graph colorings with local constraintsa survey , Discussiones Math

## J

## Approximation of k-Set Cover by Semi-Local Optimization

VIEW 3 EXCERPTS

## Graph colorings with local constraints - a survey

VIEW 1 EXCERPT