On the approximability of some Maximum Spanning Tree Problems

Author： Galbiati G. Morzenti A. Maffioli F.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.181, Iss.1, 1997-07, pp. : 107-118

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

The Complexity of Minimum Ratio Spanning Tree Problems

By Skiścim Christopher Palocsay Susan

Journal of Global Optimization, Vol. 30, Iss. 4, 2004-12 ,pp. : 335-346

Springer Publishing Company

Access to resources Recommend Favorite

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

On the approximability of the Steiner tree problem

By Thimm M.

Theoretical Computer Science, Vol. 295, Iss. 1, 2003-02 ,pp. : 387-402

Elsevier

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

Optimal Equilibria in the Non-Cooperative Game Associated with Cost Spanning Tree Problems

By Bergantiños Gustavo Lorenzo Leticia

Annals of Operations Research, Vol. 137, Iss. 1, 2005-07 ,pp. : 101-115

Springer Publishing Company

Access to resources Recommend Favorite