%0 Conference Paper %1 conf/dis/YamamotoBNM09 %A Yamamoto, Takanori %A Bannai, Hideo %A Nagasaki, Masao %A Miyano, Satoru %B Discovery Science %D 2009 %E Gama, João %E Costa, Vítor Santos %E Jorge, Alípio Mário %E Brazdil, Pavel %I Springer %K dblp %P 465-472 %T Better Decomposition Heuristics for the Maximum-Weight Connected Graph Problem Using Betweenness Centrality. %U http://dblp.uni-trier.de/db/conf/dis/dis2009.html#YamamotoBNM09 %V 5808 %@ 978-3-642-04746-6

@inproceedings{conf/dis/YamamotoBNM09, added-at = {2020-10-25T00:00:00.000+0200}, author = {Yamamoto, Takanori and Bannai, Hideo and Nagasaki, Masao and Miyano, Satoru}, biburl = {https://www.bibsonomy.org/bibtex/2f063252d7bb10ca025da16cd0ee5bc96/dblp}, booktitle = {Discovery Science}, crossref = {conf/dis/2009}, editor = {Gama, João and Costa, Vítor Santos and Jorge, Alípio Mário and Brazdil, Pavel}, ee = {https://doi.org/10.1007/978-3-642-04747-3_40}, interhash = {725988ea5485f42bba2e5b3308446e0e}, intrahash = {f063252d7bb10ca025da16cd0ee5bc96}, isbn = {978-3-642-04746-6}, keywords = {dblp}, pages = {465-472}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2020-12-01T11:35:58.000+0100}, title = {Better Decomposition Heuristics for the Maximum-Weight Connected Graph Problem Using Betweenness Centrality.}, url = {http://dblp.uni-trier.de/db/conf/dis/dis2009.html#YamamotoBNM09}, volume = 5808, year = 2009 }