A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem

Author： Hong S.-P. Chung S.-J. Park B.H.

Publisher： Elsevier

ISSN： 0167-6377

Source： Operations Research Letters, Vol.32, Iss.3, 2004-05, pp. : 233-239

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

A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees

By Wu B.Y. Chao K-M. Tang C.Y.

Journal of Algorithms, Vol. 36, Iss. 2, 2000-08 ,pp. : 182-204

Academic Press

Access to resources Recommend Favorite

Algorithms to solve the knapsack constrained maximum spanning tree problem

By Takeo Yamada Kohtaro Watanabe Seiji Kataoka

International Journal of Computer Mathematics, Vol. 82, Iss. 1, 2005-01 ,pp. : 23-34

Taylor & Francis Ltd

Access to resources Recommend Favorite

A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks

By Kamei Sayaka

Journal of Combinatorial Optimization, Vol. 25, Iss. 3, 2013-04 ,pp. : 430-459

Springer Publishing Company

Access to resources Recommend Favorite

On the probabilistic min spanning tree Problem

By Boria Nicolas

Journal of Mathematical Modelling and Algorithms, Vol. 11, Iss. 1, 2012-03 ,pp. : 45-76

Springer Publishing Company

Access to resources Recommend Favorite

A non-cooperative approach to the cost spanning tree problem

By Bergantiños Gustavo

Mathematical Methods of Operations Research, Vol. 59, Iss. 3, 2004-07 ,pp. : 393-403

Springer Publishing Company

Access to resources Recommend Favorite