Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings

DOI10.1007/978-3-642-13036-6_2zbMath1284.05189OpenAlexW2108321693MaRDI QIDQ3569805

Takuro Fukunaga

Publication date: 22 June 2010

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13036-6_2

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial optimization (90C27)

Related Items (2)

Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems ⋮ Submodular Cost Allocation Problem and Applications

This page was built for publication: Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings