A Unified Framework for Approximating Multiway Partition Problems

Authors:
Liang Zhao;Hiroshi Nagamochi;Toshihide Ibaraki
Affiliations:
Kyoto University, Kyoto, Japan;Toyohashi University of Technology, Toyohashi, Japan;Kyoto University, Kyoto, Japan
Venue:
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Year:
2009

Citing 0
Cited 2

Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Computing minimum multiway cuts in hypergraphs from hypertree packings

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present a simple and unified framework for developing and analyzing approximation algorithms for some multiway partition problems (with or without terminals), including the k-way cut (or kcut), multiterminal cut (or multiway cut), hypergraph partition and target split.