On Some Approximation Algorithms for the Set Partition Problem
Download:
|
|
by Huican Zhu, Oscar H. Ibarra
http://www.cs.ucsb.edu/~hczhu/publications/partition.ps
Add To MetaCart
Abstract:
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 efficiency of different approximation algorithms for set partition problems under different scenarios, and also presents results on approximation algorithms for edge partition and related problems.
Citations
| 7715 | Computers and Intractability: A Guide to the Theory of NP-Completeness – Garey, Johnson - 1979 |
| 542 | Human Behavior and the Principle of Least Effort – Zipf - 1949 |
| 288 | A separator theorem for planar graphs – Lipton, Tarjan - 1979 |
| 174 | Characterizing reference locality in the WWW – Almeida, Bestavros, et al. - 1996 |
| 7 | Disk packings and planar separators – Spielman, Teng - 1996 |
| 1 | Parallel Profile Matching for Large Scale Webcasting Machines – Eichstaedt, Lu, et al. - 1998 |
