Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

S. Thomas McCormick, Satoru Fujishige. Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. 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 44-53, SIAM, 2008. [doi]

This author has not been identified. Look up 'S. Thomas McCormick' in GoogleThis author has not been identified. Look up 'Satoru Fujishige' in Google

runs on WebDSL