1 paper · 1 filter
Bradley H. Theilman, Yipu Wang, Ojas D. Parekh +3
Finding the maximum cut of a graph (MAXCUT) is a classic optimization problem that has motivated parallel algorithm development. While approximate algorithms to MAXCUT offer attrac…