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

Author： Spriggs Michael J. Keil J. Mark Bespamyatnikh Sergei Segal Michael Snoeyink Jack

ISSN： 0178-4617

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

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

Related content

An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees

By Gouveia Luis

Annals of Operations Research, Vol. 146, Iss. 1, 2006-09 ,pp. : 19-39

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

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

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

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