Loading...
Please wait, while we are loading the content...
Similar Documents
A Heuristic Approach for Solving Minimum Routing Cost Spanning Tree Problem
Content Provider | Semantic Scholar |
---|---|
Author | Tan, Quoc Phan |
Copyright Year | 2012 |
Abstract | Minimum routing cost spanning tree - MRCT is one of spanning tree optimization problems having many applications in network design. In general cases, the problem is proved as NP-hard. This paper is going to propose 2 heuristic-based algorithms used for MRCT. The general idea of those algorithms is to start at a spanning tree and step by step improve edges to obtain better spanning tree. We conducted experiment implemetations for these proposals and obtained better result than the result of current approximate algorithms. |
Starting Page | 406 |
Ending Page | 409 |
Page Count | 4 |
File Format | PDF HTM / HTML |
DOI | 10.7763/IJMLC.2012.V2.154 |
Alternate Webpage(s) | http://www.ijmlc.org/papers/154-C00896-004.pdf |
Alternate Webpage(s) | http://fit.hcmup.edu.vn/~haits/Conferences/ICMLC%202011/rp070_vol.4-C00896-004.pdf |
Alternate Webpage(s) | https://doi.org/10.7763/IJMLC.2012.V2.154 |
Language | English |
Access Restriction | Open |
Content Type | Text |
Resource Type | Article |