On Some Approximation Algorithms for the Set Partition

@inproceedings{Zhu2007OnSA,
  title={On Some Approximation Algorithms for the Set Partition},
  author={P. Zhu and Oscar H. IbarraDeptartment},
  year={2007}
}
  • P. Zhu, Oscar H. IbarraDeptartment
  • Published 2007
We study the set partition problem, which is concerned with partitioning a collection of sets into P subcollections such that the maximum number of elements among all the subcollections is minimized. The problem is NP hard, even when P=2 and the cardinality of each set is 2. This special case is transferred to an edge partition problem for graphs. This paper evaluates the eeciency of diierent approximation algorithms for set partition problems under diierent scenarios, and also presents results… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

Similar Papers

Loading similar papers…