Hypergraph partitions

2019/09/18 by Mishchenko, Alexander, Manuilov, Vladimir, You, Chao +1
#Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC)

paper · doi:10.48550/arxiv.1909.08307

Abstract

We suggest a reduction of the combinatorial problem of hypergraph partitioning to a continuous optimization problem.

Related

• Problems and results on judicious partitions
• Counting and enumerating optimum cut sets for hypergraph k-partitioning problems for fixed k
• n-Level Hypergraph Partitioning
• High-Quality Hypergraph Partitioning
• Inhomogeneous Hypergraph Clustering with Applications