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

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]

Abstract

Abstract is missing.