Sublinear-time approximation of Euclidean minimum spanning tree

Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler

Research output: Contribution to conferencePaperpeer-review


We consider the problem of finding the weight of a Euclidean minimum spanning tree for a set of n points in ℝd. We focus on the situation when the input point set is supported by certain basic (and commonly used) geometric data structures that can provide efficient access to the input in a structured way. We present an algorithm that estimates with high probability the weight of a Euclidean minimum spanning tree of a set of points to within 1 + ε using only Õ(√n poly(1/ε)) queries for constant d. The algorithm assumes that the input is supported by a minimal bounding cube enclosing it, by orthogonal range queries, and by cone approximate nearest neighbors queries.

Original languageEnglish
Number of pages10
StatePublished - 2003
EventConfiguralble Computing: Technology and Applications - Boston, MA, United States
Duration: 2 Nov 19983 Nov 1998


ConferenceConfiguralble Computing: Technology and Applications
Country/TerritoryUnited States
CityBoston, MA

ASJC Scopus subject areas

  • Software
  • Mathematics (all)


Dive into the research topics of 'Sublinear-time approximation of Euclidean minimum spanning tree'. Together they form a unique fingerprint.

Cite this