Login / Signup
Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree.
Michael J. Spriggs
J. Mark Keil
Sergei Bespamyatnikh
Michael Segal
Jack Snoeyink
Published in:
Algorithmica (2004)
Keyphrases
</>
spanning tree
edge disjoint
minimum cost
minimum spanning tree
minimum weight
minimum spanning trees
minimum total cost
undirected graph
weighted graph
efficient computation
maximum distance
edge weights
social networks
geometric information
geometric constraints
dynamic programming
cost function