Parallelized approximation algorithms for minimum routing cost spanning trees

Details Parallelized approximation algorithms for minimum routing cost spanning trees Parallelized approximation algorithms for minimum routing cost spanning trees

2007-05-15

arxiv.org/abs/0705.2125v2

Computer Science

Data Structures and Algorithms

Scientific paper

We parallelize several previously proposed algorithms for the minimum routing
cost spanning tree problem and some related problems.

Affiliated with

Also associated with

No associations

Rating

Parallelized approximation algorithms for minimum routing cost spanning trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Parallelized approximation algorithms for minimum routing cost spanning trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallelized approximation algorithms for minimum routing cost spanning trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-623043