Themaximumsaving partition problem

@inproceedings{Hassina2004ThemaximumsavingPP,
  title={Themaximumsaving partition problem},
  author={Refael Hassina and J{\'e}r{\^o}me Monnotb},
  year={2004}
}
  • Refael Hassina, Jérôme Monnotb
  • 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

M. Demange, D. De Werra
  • Monnot, V.Th. Paschos, Weighted node coloring: when stable sets are expensive (Extended abstract), Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, vol. 2573, 2002 114–125. 248 R. Hassin, J. Monnot / Operations Resea
  • 2005
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

S

R. Hassin
  • Khuller,Z-Approximations, J. Algorithms 41
  • 2001
VIEW 1 EXCERPT

Graph colorings with local constraintsa survey , Discussiones Math

Z. Tuza
  • Graph Theory
  • 2000

J

M. Demange
  • Monnot, V.Th. Paschos, Bridging gap between standard and differential polynomial approximation: the case of bin-packing, Appl. Math. Lett. 12
  • 1999

Approximation results for the optimum cost chromatic partition problem

  • Network Design: Connectivity and Facilities Location
  • 1997
VIEW 1 EXCERPT

Graph colorings with local constraints - a survey

  • Discussiones Mathematicae Graph Theory
  • 1997
VIEW 1 EXCERPT