Open access peer-reviewed chapter

Heuristic Algorithms for Solving Bounded Diameter Minimum Spanning Tree Problem and Its Application to Genetic Algorithm Development

By Nguyen Duc Nghia and Huynh Thi Thanh Binh

Published: November 1st 2008

DOI: 10.5772/6345

Downloaded: 3130

© 2008 The Author(s). Licensee IntechOpen. This chapter is distributed under the terms of the Creative Commons Attribution-NonCommercial-ShareAlike-3.0 License, which permits use, distribution and reproduction for non-commercial purposes, provided the original is properly cited and derivative works building on this content are distributed under the same license.

How to cite and reference

Link to this chapter Copy to clipboard

Cite this chapter Copy to clipboard

Nguyen Duc Nghia and Huynh Thi Thanh Binh (November 1st 2008). Heuristic Algorithms for Solving Bounded Diameter Minimum Spanning Tree Problem and Its Application to Genetic Algorithm Development, Greedy Algorithms, Witold Bednorz, IntechOpen, DOI: 10.5772/6345. Available from:

chapter statistics

3130total chapter downloads

More statistics for editors and authors

Login to your personal dashboard for more detailed statistics on your publications.

Access personal reporting

Related Content

This Book

Next chapter

Opportunistic Scheduling for Next Generation Wireless Local Area Networks

By Ertuğrul Necdet Çiftçioğlu and Özgür Gürbüz

Related Book

First chapter

Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches

By Rajesh Matai, Surya Singh and Murari Lal Mittal

We are IntechOpen, the world's leading publisher of Open Access books. Built by scientists, for scientists. Our readership spans scientists, professors, researchers, librarians, and students, as well as business professionals. We share our knowledge and peer-reveiwed research papers with libraries, scientific and engineering societies, and also work with corporate R&D departments and government entities.

More about us