5 citations · 8 across the 5 of their papers we have counts for
1 paper · 1 filter
Yatao Bian, Alexey Gronskiy, Joachim M. Buhmann
MAXCUT defines a classical NP-hard problem for graph partitioning and it serves as a typical case of the symmetric non-monotone Unconstrained Submodular Maximization (USM) problem.…