Parallel Architectures, Algorithms and Programming, International Symposium on (2010)

Dalian, Liaoning China

Dec. 18, 2010 to Dec. 20, 2010

ISBN: 978-0-7695-4312-3

pp: 395-397

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PAAP.2010.23

ABSTRACT

The capacitated min-k-cut problem of hypergraphis the problem of partitioning the vertices into k parts, and each part has a different capacity. The objective is to minimize the weight of cut hyper edges. It is an NP-hard problem which is an important problem with extensive applications to many areas, such as VLSI CAD, image segmentation, etc. Although many heuristic algorithms have been developed, to the best of our knowledge, no approximation algorithm is known for such problem. We present a local search algorithm for hyper graph capacitated min-k-cut problem, using the idea of complement. The algorithm achieves a competitive approximation factor of 1/(1+s/2(k-1)), where s is the largest cardinality of all hyper edges. We also extend the algorithm and get an approximate result for hyper graph capacitated max-k-cut problem.

INDEX TERMS

Capacitated min-k-cut, approximation algorithm, hypergraph partitioning

CITATION

Jiarui Chen,
Wenxing Zhu,
"The Complement of Hypergraph Capacitated Min-k-Cut Problem",

*Parallel Architectures, Algorithms and Programming, International Symposium on*, vol. 00, no. , pp. 395-397, 2010, doi:10.1109/PAAP.2010.23