Better Decomposition Heuristics for the Maximum-Weight Connected Graph Problem Using Betweenness Centrality - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Takanori Yamamoto, Hideo Bannai, Masao Nagasaki, Satoru Miyano. Better Decomposition Heuristics for the Maximum-Weight Connected Graph Problem Using Betweenness Centrality. In JoÃ£o Gama, VÃtor Santos Costa, AlÃpio MÃ¡rio Jorge, Pavel Brazdil, editors, Discovery Science, 12th International Conference, DS 2009, Porto, Portugal, October 3-5, 2009. Volume 5808 of Lecture Notes in Computer Science, pages 465-472, Springer, 2009. [doi]

This author has not been identified. Look up 'Takanori Yamamoto' in GoogleThis author has not been identified. Look up 'Hideo Bannai' in GoogleThis author has not been identified. Look up 'Masao Nagasaki' in GoogleThis author has not been identified. Look up 'Satoru Miyano' in Google

runs on WebDSL