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

The Digital Librarian's Digital Library

DOCIS Documents in Computing and Information Science

Home >> Journals and Conference Proceedings >> Algorithmica

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

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

Journal Title: Algorithmica

Date: 2004

Volume: 38

Issue: 4

p. 577 - 589

For further information about this item go to:

http://dx.doi.org/10.1007/s00453-003-1056-z

This data comes from DBLP

This page is maintained by Angela Cornwell and Thomas Krichel.
It was last updated on 2006-04-12