14 citations · 14 across the 11 of their papers we have counts for
1 paper · 1 filter
Yeqing Qiu, Ye Xue, Akang Wang +3
The Max-k-Cut problem is a fundamental combinatorial optimization challenge that generalizes the classic NP-complete Max-Cut problem. While relaxation techniques are commonly emplo…