Yet another algorithm for dense max cut: go greedy - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Claire Mathieu' in GoogleThis author has not been identified. Look up 'Warren Schudy' in Google

runs on WebDSL