On the Euclidean Minimum Spanning Tree Problem

Author： Rajasekaran Sanguthevar  

Publisher： VSP

ISSN： 1574-0404

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

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

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

RAMP for the capacitated minimum spanning tree problem

By Rego Cesar  

Annals of Operations Research, Vol. 181, Iss. 1, 2010-12 ,pp. : 661-681

Springer Publishing Company

Access to resources Recommend Favorite

The geometric generalized minimum spanning tree problem with grid clustering

By Feremans Corinne  

4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol. 4, Iss. 4, 2006-12 ,pp. : 319-329

Springer Publishing Company

Access to resources Recommend Favorite

Degree constrained minimum spanning tree problem: a learning automata approach

By Akbari Torkestani Javad  

The Journal of Supercomputing, Vol. 64, Iss. 1, 2013-04 ,pp. : 226-249

Springer Publishing Company

Access to resources Recommend Favorite

Improved heuristics for the bounded-diameter minimum spanning tree problem

By Singh Alok   Gupta Ashok  

Soft Computing, Vol. 11, Iss. 10, 2007-08 ,pp. : 911-921

Springer Publishing Company

Access to resources Recommend Favorite