Yet another algorithm for dense max cut: go greedy

Claire Mathieu, Warren Schudy. Yet another algorithm for dense max cut: go greedy. In Shang-Hua Teng, editor, Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008. pages 176-182, SIAM, 2008. [doi]

Abstract

Abstract is missing.