Approximation Algorithms for Quickest Spanning Tree Problems

ISSN： 0178-4617

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

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

Related content

Parallel approximation algorithms for minimum routing cost spanning tree

By Chen Kun Hsieh Yung En Lu Ping Jung

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

Inderscience Publishers

Access to resources Recommend Favorite

The property analysis of evolutionary algorithms applied to spanning tree problems

By Soak Sang-Moon Jeon Moongu

Applied Intelligence, Vol. 32, Iss. 1, 2010-02 ,pp. : 96-121

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

Algorithms for the optimum communication spanning tree problem

By Sharma Prabha

Annals of Operations Research, Vol. 143, Iss. 1, 2006-03 ,pp. : 203-209

Springer Publishing Company

Access to resources Recommend Favorite

Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems

By Khani M. Salavatipour Mohammad

Algorithmica, Vol. 69, Iss. 2, 2014-06 ,pp. : 443-460

Springer Publishing Company

Access to resources Recommend Favorite