Article thumbnail

Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization

By K. Ando, K. Ando, K. Ando, K. Ando, D.L. Applegate, R.E. Bixby, A. Bouchet, A. Bouchet, R. Chandrasekaran, W.H. Cunningham, W.H. Cunningham, W.H. Cunningham, A. Dress, F.D.J. Dunstan, S. Fujishige, S. Fujishige, S. Fujishige, S. Fujishige, A.V. Goldberg, A.V. Goldberg, M. Grötschel, M. Grötschel, S. Iwata, S. Iwata, S. Iwata, S.N. Kabadi, S.T. McCormick, N. Megiddo, K. Murota, K. Nagano, M. Nakamura, L. Qi, M.N. Queyranne, V. Reiner, A. Schrijver, A. Shrijver, A. Schrijver, A. Schrijver, É. Tardos, J. Vygen and F. Zhang
Publisher: 'Springer Science and Business Media LLC'
DOI identifier: 10.1007/s10107-008-0242-9
OAI identifier:
Provided by: MUCC (Crossref)
Sorry, our data provider has not provided any external links therefore we are unable to provide a link to the full text.

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.