Login / Signup

Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time.

Artur CzumajFunda ErgünLance FortnowAvner MagenIlan NewmanRonitt RubinfeldChristian Sohler
Published in: SIAM J. Comput. (2005)
Keyphrases
  • minimum spanning tree
  • spanning tree
  • edge weights
  • graph theory
  • weighted graph
  • steiner tree
  • shortest path
  • traveling salesman problem
  • minimum weight
  • euclidean distance
  • euclidean space
  • image segmentation