Dynamic algorithms for approximating interdistances

Sergei Bespamyatnikh; Michael Segal

doi:10.1007/3-540-45061-0_89

Dynamic algorithms for approximating interdistances

Sergei Bespamyatnikh, Michael Segal

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

In this paper we present efficient dynamic algorithms for approximation of k^th, 1 ≤ k ≤ (₂ⁿ) distance defined by some pair of points from a given set S of n points in d-dimensional space, for every fixed d. Our technique is based on dynamization of well-separated pair decomposition proposed in [11], computing approximate nearest and farthest neighbors [23,26] and use of persistent search trees [18].

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, Gerhard J. Woeginger
Publisher	Springer Verlag
Pages	1169-1180
Number of pages	12
ISBN (Print)	3540404937, 9783540404934
DOIs	https://doi.org/10.1007/3-540-45061-0_89
State	Published - 1 Jan 2003

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2719
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-45061-0_89

Cite this

Bespamyatnikh, S., & Segal, M. (2003). Dynamic algorithms for approximating interdistances. In J. C. M. Baeten, J. K. Lenstra, J. Parrow, & G. J. Woeginger (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 1169-1180). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2719). Springer Verlag. https://doi.org/10.1007/3-540-45061-0_89

Bespamyatnikh, Sergei ; Segal, Michael. / Dynamic algorithms for approximating interdistances. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Jos C. M. Baeten ; Jan Karel Lenstra ; Joachim Parrow ; Gerhard J. Woeginger. Springer Verlag, 2003. pp. 1169-1180 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{cd519ba597db469cbc7eb3e16df59af4,

title = "Dynamic algorithms for approximating interdistances",

abstract = "In this paper we present efficient dynamic algorithms for approximation of kth, 1 ≤ k ≤ (2n) distance defined by some pair of points from a given set S of n points in d-dimensional space, for every fixed d. Our technique is based on dynamization of well-separated pair decomposition proposed in [11], computing approximate nearest and farthest neighbors [23,26] and use of persistent search trees [18].",

author = "Sergei Bespamyatnikh and Michael Segal",

year = "2003",

month = jan,

day = "1",

doi = "10.1007/3-540-45061-0_89",

language = "English",

isbn = "3540404937",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "1169--1180",

editor = "Baeten, {Jos C. M.} and Lenstra, {Jan Karel} and Joachim Parrow and Woeginger, {Gerhard J.}",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

address = "Germany",

}

Bespamyatnikh, S & Segal, M 2003, Dynamic algorithms for approximating interdistances. in JCM Baeten, JK Lenstra, J Parrow & GJ Woeginger (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2719, Springer Verlag, pp. 1169-1180. https://doi.org/10.1007/3-540-45061-0_89

Dynamic algorithms for approximating interdistances. / Bespamyatnikh, Sergei; Segal, Michael.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Jos C. M. Baeten; Jan Karel Lenstra; Joachim Parrow; Gerhard J. Woeginger. Springer Verlag, 2003. p. 1169-1180 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2719).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Dynamic algorithms for approximating interdistances

AU - Bespamyatnikh, Sergei

AU - Segal, Michael

PY - 2003/1/1

Y1 - 2003/1/1

N2 - In this paper we present efficient dynamic algorithms for approximation of kth, 1 ≤ k ≤ (2n) distance defined by some pair of points from a given set S of n points in d-dimensional space, for every fixed d. Our technique is based on dynamization of well-separated pair decomposition proposed in [11], computing approximate nearest and farthest neighbors [23,26] and use of persistent search trees [18].

AB - In this paper we present efficient dynamic algorithms for approximation of kth, 1 ≤ k ≤ (2n) distance defined by some pair of points from a given set S of n points in d-dimensional space, for every fixed d. Our technique is based on dynamization of well-separated pair decomposition proposed in [11], computing approximate nearest and farthest neighbors [23,26] and use of persistent search trees [18].

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

U2 - 10.1007/3-540-45061-0_89

DO - 10.1007/3-540-45061-0_89

M3 - Chapter

AN - SCOPUS:35248845961

SN - 3540404937

SN - 9783540404934

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1169

EP - 1180

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Baeten, Jos C. M.

A2 - Lenstra, Jan Karel

A2 - Parrow, Joachim

A2 - Woeginger, Gerhard J.

PB - Springer Verlag

ER -

Bespamyatnikh S, Segal M. Dynamic algorithms for approximating interdistances. In Baeten JCM, Lenstra JK, Parrow J, Woeginger GJ, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2003. p. 1169-1180. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45061-0_89

Dynamic algorithms for approximating interdistances

Abstract

Publication series

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this