Author： Könemann Jochen Levin Asaf Sinha Amitabh
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.41, Iss.2, 2004-11, pp. : 117-129
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
Improved heuristics for the bounded-diameter minimum spanning tree problem
Soft Computing, Vol. 11, Iss. 10, 2007-08 ,pp. :
Access to resources
Recommend
On the Euclidean Minimum Spanning Tree Problem
Computing Letters, Vol. 1, Iss. 1, 2005-01 ,pp. :
On the prize-collecting generalized minimum spanning tree problem
By Pop P.
Annals of Operations Research, Vol. 150, Iss. 1, 2007-03 ,pp. :
RAMP for the capacitated minimum spanning tree problem
By Rego Cesar
Annals of Operations Research, Vol. 181, Iss. 1, 2010-12 ,pp. :