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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.