Computing minimum multiway cuts in hypergraphs from hypertree packings

Authors:
Takuro Fukunaga
Affiliations:
Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Japan
Venue:
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Year:
2010

Citing 14
Cited 2

A new approach to the maximum-flow problem

Journal of the ACM (JACM)
A polynomial algorithm for the k-cut problem for fixed k

Mathematics of Operations Research
A new approach to the minimum cut problem

Journal of the ACM (JACM)
A simple min-cut algorithm

Journal of the ACM (JACM)
A fast hypergraph min-cut algorithm for circuit partitioning

Integration, the VLSI Journal
On decomposing a hypergraph into k connected sub-hypergraphs

Discrete Applied Mathematics - Submodularity
Multiway cuts in node weighted graphs

Journal of Algorithms
Fully-Dynamic Min-Cut

Combinatorica
A Deterministic Algorithm for Finding All Minimum $k$-Way Cuts

SIAM Journal on Computing
Minimum k-way cuts via deterministic greedy tree packing

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
An Improved Divide-and-Conquer Algorithm for Finding All Minimum k-Way Cuts

ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
A Unified Framework for Approximating Multiway Partition Problems

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Finding minimum 3-way cuts in hypergraphs

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation

Submodular cost allocation problem and applications

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Hypergraph learning with hyperedge expansion

ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hypergraph k-cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into k connected components. We present an algorithm for this problem which runs in strongly polynomial-time if both k and the rank of the hypergraph are constants. Our algorithm extends the algorithm due to Thorup (2008) for computing minimum k-cuts of graphs from greedy packings of spanning trees.