Parallelized approximation algorithms for minimum routing cost spanning trees

Simple item page
dc.creatorChang, Ching-Lueh
dc.creatorLyuu, Yuh-Dauh
dc.date2007-05-15
dc.date2007-07-04
dc.date.accessioned2026-07-07T08:13:40Z
dc.date.available2026-07-07T08:13:40Z
dc.descriptionWe parallelize several previously proposed algorithms for the minimum routing cost spanning tree problem and some related problems.
dc.identifierhttps://arxiv.org/abs/0705.2125
dc.identifierhttp://arxiv.org/abs/0705.2125
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/132848
dc.subjectData Structures and Algorithms
dc.subjectComputational Complexity
dc.titleParallelized approximation algorithms for minimum routing cost spanning trees
dc.typetext

Files

Collections

arXiv