Parallelized approximation algorithms for minimum routing cost spanning trees
Ching-Lueh Chang, Yuh-Dauh Lyuu
TL;DR
This paper presents parallelized versions of existing algorithms to efficiently solve the minimum routing cost spanning tree problem, enhancing computational performance for large networks.
Contribution
It introduces parallelization techniques for several known algorithms addressing the minimum routing cost spanning tree problem.
Findings
Improved computational efficiency through parallelization
Enhanced scalability for large network instances
Potential for faster solutions in practical applications
Abstract
We parallelize several previously proposed algorithms for the minimum routing cost spanning tree problem and some related problems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Complexity and Algorithms in Graphs · Advanced Graph Theory Research