Balanced k-way hypergraph partitioning is cast as QUBO and higher-order binary problems for quantum optimization, with small-instance tests confirming effectiveness for the all-or-nothing cut on 3-uniform hypergraphs.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Replication reduces costs by 17-65% on average in hypergraph partitioning and 11-23% in DAG scheduling, sometimes eliminating communication needs entirely.
citing papers explorer
-
Quantum Hypergraph Partitioning
Balanced k-way hypergraph partitioning is cast as QUBO and higher-order binary problems for quantum optimization, with small-instance tests confirming effectiveness for the all-or-nothing cut on 3-uniform hypergraphs.
-
Replication in Graph Partitioning and Scheduling Problems
Replication reduces costs by 17-65% on average in hypergraph partitioning and 11-23% in DAG scheduling, sometimes eliminating communication needs entirely.