Proximity algorithms for nearly doubling spaces

Lee Ad Gottlieb; Robert Krauthgamer

doi:10.1137/120874242

Proximity algorithms for nearly doubling spaces

Lee Ad Gottlieb, Robert Krauthgamer

Ariel University

Research output: Contribution to journal › Article › peer-review

17 Scopus citations

Abstract

We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d, remove from S the fewest number of points so that the remaining set has doubling dimension at most d. We present a bicriteria approximation for this problem and extend this algorithm to solve a group of proximity problems.

Original language	English
Pages (from-to)	1759-1769
Number of pages	11
Journal	SIAM Journal on Discrete Mathematics
Volume	27
Issue number	4
DOIs	https://doi.org/10.1137/120874242
State	Published - 2013

Keywords

All points nearest neighbor
Approximate distance oracle
Approximate minimum spanning tree
Doubling dimension
Metric spanners

Access to Document

10.1137/120874242

Cite this

@article{0f654afe8aca4d609d110abb5c291a7e,

title = "Proximity algorithms for nearly doubling spaces",

abstract = "We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d, remove from S the fewest number of points so that the remaining set has doubling dimension at most d. We present a bicriteria approximation for this problem and extend this algorithm to solve a group of proximity problems.",

keywords = "All points nearest neighbor, Approximate distance oracle, Approximate minimum spanning tree, Doubling dimension, Metric spanners",

author = "Gottlieb, {Lee Ad} and Robert Krauthgamer",

year = "2013",

doi = "10.1137/120874242",

language = "אנגלית",

volume = "27",

pages = "1759--1769",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "4",

}

TY - JOUR

T1 - Proximity algorithms for nearly doubling spaces

AU - Gottlieb, Lee Ad

AU - Krauthgamer, Robert

PY - 2013

Y1 - 2013

N2 - We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d, remove from S the fewest number of points so that the remaining set has doubling dimension at most d. We present a bicriteria approximation for this problem and extend this algorithm to solve a group of proximity problems.

AB - We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d, remove from S the fewest number of points so that the remaining set has doubling dimension at most d. We present a bicriteria approximation for this problem and extend this algorithm to solve a group of proximity problems.

KW - All points nearest neighbor

KW - Approximate distance oracle

KW - Approximate minimum spanning tree

KW - Doubling dimension

KW - Metric spanners

UR - http://www.scopus.com/inward/record.url?scp=84891286178&partnerID=8YFLogxK

U2 - 10.1137/120874242

DO - 10.1137/120874242

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84891286178

SN - 0895-4801

VL - 27

SP - 1759

EP - 1769

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

IS - 4

ER -

Proximity algorithms for nearly doubling spaces

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this