Parallelized approximation algorithms for minimum routing cost spanning trees
classification
💻 cs.DS
cs.CC
keywords
algorithmscostminimumroutingspanningapproximationparallelizeparallelized
read the original abstract
We parallelize several previously proposed algorithms for the minimum routing cost spanning tree problem and some related problems.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.