The geometric generalized minimum spanning tree problem with grid clustering

Author： Feremans Corinne  

Publisher： Springer Publishing Company

ISSN： 1619-4500

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

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

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

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

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

Computing a (1+ε)-Approximate Geometric Minimum-Diameter Spanning Tree

By Spriggs Michael J.   Keil J. Mark   Bespamyatnikh Sergei   Segal Michael   Snoeyink Jack  

Algorithmica, Vol. 38, Iss. 4, 2004-01 ,pp. : 577-589

Springer Publishing Company

Access to resources Recommend Favorite