Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems

DOI10.1007/978-3-642-10631-6_8zbMATH Open1272.68337OpenAlexW40005982MaRDI QIDQ3652191FDOQ3652191

Authors: Kazumasa Okumoto, Takuro Fukunaga, Hiroshi Nagamochi 

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

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

Recommendations

• Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
• Greedy splitting algorithms for approximating multiway partition problems
• Submodular Cost Allocation Problem and Applications
• On generalized greedy splitting algorithms for multiway partition problems
• Improving graph partitions using submodular functions.

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Hypergraphs (05C65)

Cited In (9)

• Greedy splitting algorithms for approximating multiway partition problems
• Improving graph partitions using submodular functions.
• A polynomial time algorithm for finding a minimum 4-partition of a submodular function
• Min-max partitioning of hypergraphs and symmetric submodular functions
• Finding minimum 3-way cuts in hypergraphs
• Submodular Cost Allocation Problem and Applications
• Approximating submodular \(k\)-partition via principal partition sequence
• Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
• Title not available (Why is that?)

This page was built for publication: Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3652191)