Skip to main content

Faster geometric k-point MST approximation

Download / Buy Article:

This article is hosted on another website.

You may be required to register, activate a subscription or purchase the article before you can obtain the full text.

Proceed

Keywords: Approximation; Clustering; Geometric network design; Minimum spanning tree; Quadtree

Document Type: Research Article

DOI: http://dx.doi.org/10.1016/S0925-7721(96)00021-1

Affiliations: Department of Information and Computer Science, University of California, Irvine, CA 92697, USA

Publication date: October 1, 1997

els/09257721/1997/00000008/00000005/art00021
dcterms_title,dcterms_description,pub_keyword
6
5
20
40
5

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more