Approximating Maximum Leaf Spanning Trees in Almost Linear Time

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.29, Iss.1, 1998-10, pp. : 132-141

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

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

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

Degree Bounded Spanning Trees

By Fujisawa Jun

Graphs and Combinatorics, Vol. 26, Iss. 5, 2010-09 ,pp. : 695-720

Springer Publishing Company

Access to resources Recommend Favorite

Signpost systems and spanning trees of graphs

By Nebeský Ladislav

Czechoslovak Mathematical Journal, Vol. 56, Iss. 3, 2006-09 ,pp. : 885-893

Springer Publishing Company

Access to resources Recommend Favorite

Increasing the Weight of Minimum Spanning Trees

By Frederickson G.N. Solis-Oba R.

Journal of Algorithms, Vol. 33, Iss. 2, 1999-11 ,pp. : 244-266

Academic Press

Access to resources Recommend Favorite