Improving the Smoothed Complexity of FLIP for Max Cut Problems

Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran. Improving the Smoothed Complexity of FLIP for Max Cut Problems. ACM Transactions on Algorithms, 17(3), 2021. [doi]

Abstract

Abstract is missing.