|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2009 First Asian Conference on Intelligent Information and Database Systems
New Multi-parent Recombination in Genetic Algorithm for Solving Bounded Diameter Minimum Spanning Tree Problem
Dong hoi, Quang binh, Vietnam
April 01-April 03
ISBN: 978-0-7695-3580-7
| ASCII Text | x | ||
| Huynh Thi Thanh Binh, Nguyen Duc Nghia, "New Multi-parent Recombination in Genetic Algorithm for Solving Bounded Diameter Minimum Spanning Tree Problem," Intelligent Information and Database Systems, Asian Conference on, pp. 283-288, 2009 First Asian Conference on Intelligent Information and Database Systems, 2009. | |||
| BibTex | x | ||
| @article{ 10.1109/ACIIDS.2009.89, author = {Huynh Thi Thanh Binh and Nguyen Duc Nghia}, title = {New Multi-parent Recombination in Genetic Algorithm for Solving Bounded Diameter Minimum Spanning Tree Problem}, journal ={Intelligent Information and Database Systems, Asian Conference on}, volume = {0}, year = {2009}, isbn = {978-0-7695-3580-7}, pages = {283-288}, doi = {http://doi.ieeecomputersociety.org/10.1109/ACIIDS.2009.89}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Intelligent Information and Database Systems, Asian Conference on TI - New Multi-parent Recombination in Genetic Algorithm for Solving Bounded Diameter Minimum Spanning Tree Problem SN - 978-0-7695-3580-7 SP283 EP288 A1 - Huynh Thi Thanh Binh, A1 - Nguyen Duc Nghia, PY - 2009 KW - bounded diameter minimum spanning tree KW - genetic algorithm KW - multi-parent VL - 0 JA - Intelligent Information and Database Systems, Asian Conference on ER - | |||
Given a connected, weighted, undirected graph G=(V, E) and a bound D, Bounded Diameter Minimum Spanning Tree problem (BDMST) seeks spanning tree on G with smallest weight in which no path between two vertices contains more than D edges. This problem is NP-hard for 4 ≤ D
Index Terms:
bounded diameter minimum spanning tree, genetic algorithm, multi-parent
Citation:
Huynh Thi Thanh Binh, Nguyen Duc Nghia, "New Multi-parent Recombination in Genetic Algorithm for Solving Bounded Diameter Minimum Spanning Tree Problem," aciids, pp.283-288, 2009 First Asian Conference on Intelligent Information and Database Systems, 2009
Usage of this product signifies your acceptance of the Terms of Use.