ROS relaxes Max-k-Cut to continuous simplex, optimizes via GNN, and samples back, achieving fast large-scale solving with expectation-preserving mapping.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems
ROS relaxes Max-k-Cut to continuous simplex, optimizes via GNN, and samples back, achieving fast large-scale solving with expectation-preserving mapping.