An experimental study of minimum routing cost spanning tree algorithms

Tan, Quoc Phan; Due, Nghia Nguyen

doi:10.1109/socpar.2013.7054119

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2016

2022

Publication Types

Select...

Article2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Even though not as famous as traveling salesman problems where many researchers have been involved in that topic, some researchers have already investigated the MRCST problem, including Wu (2002) ; Wolf and Merz (2010) ; Chen et al (2013) ; Tan and Due (2013) ; Lin et al (2006) and Sattari and Didehvar (2013) . Since the MRCST is an NP-hard problem, then heuristic algorithms are investigated more, for example, Singh (2008) and Tan (2012b) .…”

Section: Introductionmentioning

confidence: 99%

The Diameter and Maximum Link of the Minimum Routing Cost Spanning Tree Problem

Sari

Wamiliana

Junaidi

et al. 2022

Sci. Technol. Indones

View full text Add to dashboard Cite

The minimum routing cost spanning tree (MRCST) is a spanning tree that minimizes the sum of pairwise distances between its vertices given a weighted graph. In this study, we use Campos Algorithm with slight modifications on the coefficient of spanning potential. Those algorithms were implemented on a random table problem data of complete graphs of order 10 to 100 in increments of 10. The goal is to find the diameter (the largest shortest path distance) and the maximum link (the maximum number of edges connecting two vertices) in the spanning tree solution of MRCST. The result shows that a slight modification of the spanning potential coefficients gives better solutions.

show abstract