Parallelized approximation algorithms for minimum routing cost spanning trees

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Citation

Consulte el texto completo en el siguiente enlace:

Collections