• Jul 03, 2017 News!Good News! Since 2017, IJMLC has been indexed by Scopus!
  • Aug 15, 2017 News![CFP] 2017 the annual meeting of IJMLC Editorial Board, ACMLC 2017, will be held in Singapore, December 8-10, 2017.   [Click]
  • Sep 09, 2017 News!Vol.7, No.4 has been published with online version.   [Click]
Search
General Information
Editor-in-chief
Dr. Lin Huang
Metropolitan State University of Denver, USA
It's my honor to take on the position of editor in chief of IJMLC. We encourage authors to submit papers concerning any branch of machine learning and computing.
IJMLC 2012 Vol.2(4): 410-414 ISSN: 2010-3700
DOI: 10.7763/IJMLC.2012.V2.155

A Genetic Approach for Solving Minimum Routing Cost Spanning Tree Problem

Quoc Phan Tan

Abstract—Minimum Routing Cost Spanning Tree (MRCT) is one of spanning tree optimization problems having several applications in network design. In general case, the problem is proved to be NP-hard. The paper uses genetic (GA) approach to solve MRCT problem. Computational experiment results show that GA approach outperforms current approximation algorithms.

Index Terms—Routing Cost Spanning Tree, Genetic Algorithm, Metaheuristic Algorithm, Spanning Tree Optimization Problem.

Quoc Phan Tan is with Department of Information Technology of Saigon University, Ho Chi Minh city, Vietnam (email: phantanquoc@gmail.com).

[PDF]

Cite: Quoc Phan Tan, "A Genetic Approach for Solving Minimum Routing Cost Spanning Tree Problem," International Journal of Machine Learning and Computing vol. 2, no. 4, pp. 410-414, 2012.

Copyright © 2008-2015. International Journal of Machine Learning and Computing. All rights reserved.
E-mail: ijmlc@ejournal.net