Closed-form tight penalty coefficients for two QUBO reformulations of max-k-cut that depend on the weighted degrees of graph vertices.
What works best when? a systematic evaluation of heuristics for max-cut and QUBO
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Characterizing QUBO Reformulations of the Max-k-Cut Problem for Quantum Computing
Closed-form tight penalty coefficients for two QUBO reformulations of max-k-cut that depend on the weighted degrees of graph vertices.