Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem

By Könemann Jochen   Levin Asaf   Sinha Amitabh  

Algorithmica, Vol. 41, Iss. 2, 2004-11 ,pp. : 117-129

Springer Publishing Company

Access to resources Recommend Favorite

On the Euclidean Minimum Spanning Tree Problem

By Rajasekaran Sanguthevar  

Computing Letters, Vol. 1, Iss. 1, 2005-01 ,pp. : 11-14

VSP

Access to resources Recommend Favorite

Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem

By Gouveia Luis  

Journal of Heuristics, Vol. 17, Iss. 1, 2011-02 ,pp. : 23-37

Springer Publishing Company

Access to resources Recommend Favorite

Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem

By Shyu S. J.  

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 15, Iss. 1, 2003-01 ,pp. : 103-112

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the prize-collecting generalized minimum spanning tree problem

By Pop P.  

Annals of Operations Research, Vol. 150, Iss. 1, 2007-03 ,pp. : 193-204

Springer Publishing Company

Access to resources Recommend Favorite