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

Takanori Yamamoto, Hideo Bannai, Masao Nagasaki, Satoru Miyano

Browse the full DIS paper archive.