AI RESEARCH
Exploiting Low-Rank Structure in Max-K-Cut Problems
arXiv CS.LG
•
ArXi:2602.20376v2 Announce Type: replace-cross We approach the Max-3-Cut problem through the lens of maximizing complex-valued quadratic forms and nstrate that low-rank structure in the objective matrix can be exploited, leading to alternative algorithms to classical semidefinite programming (SDP) relaxations and heuristic techniques.