Parallel approximation algorithms for minimum routing cost spanning tree

Author： Chen Kun   Hsieh Yung En   Lu Ping Jung  

Publisher： Inderscience Publishers

ISSN： 1742-7185

Source： International Journal of Computational Science and Engineering, Vol.8, Iss.4, 2013-10, pp. : 336-348

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Approximation Algorithms for Quickest Spanning Tree Problems

By Hassin Refael   Levin Asaf  

Algorithmica, Vol. 41, Iss. 1, 2004-10 ,pp. : 43-52

Springer Publishing Company

Access to resources Recommend Favorite

Linear-time algorithms for parametric minimum spanning tree problems on planar graphs

By Fernandez-Baca D.   Slutzki G.  

Theoretical Computer Science, Vol. 181, Iss. 1, 1997-07 ,pp. : 57-74

Elsevier

Access to resources Recommend Favorite

Parallel algorithms for the minimum cut and the minimum length tree layout problems

By Diaz J.   Gibbons A.   Pantziou G.E.   Serna M.J.   Spirakis P.G.   Toran J.  

Theoretical Computer Science, Vol. 181, Iss. 2, 1997-07 ,pp. : 267-287

Elsevier

Access to resources Recommend Favorite

On the Euclidean Minimum Spanning Tree Problem

By Rajasekaran Sanguthevar  

Computing Letters, Vol. 1, Iss. 1, 2005-01 ,pp. : 11-14

VSP

Access to resources Recommend Favorite

The Stackelberg Minimum Spanning Tree Game

By Cardinal Jean   Demaine Erik   Fiorini Samuel   Joret Gwenaël   Langerman Stefan   Newman Ilan   Weimann Oren  

Algorithmica, Vol. 59, Iss. 2, 2011-02 ,pp. : 129-144

Springer Publishing Company

Access to resources Recommend Favorite