Fast algorithms for approximating distances

S. Bespamyatnikh; M. Segal

doi:10.1007/s00453-001-0114-7

Fast algorithms for approximating distances

S. Bespamyatnikh
, M. Segal

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

9 Scopus citations

Abstract

In this paper we present efficient approximation algorithms for the distance selection problem. Our technique is based on the well-separated pair decomposition proposed in [8].

Original language	English
Pages (from-to)	263-269
Number of pages	7
Journal	Algorithmica
Volume	33
Issue number	2
DOIs	https://doi.org/10.1007/s00453-001-0114-7
State	Published - 1 Jan 2002

Keywords

Approximation algorithms
Distance selection problem
Well-separated pair decomposition

ASJC Scopus subject areas

General Computer Science
Computer Science Applications
Applied Mathematics

Access to Document

10.1007/s00453-001-0114-7

Cite this

@article{4a53f4c19faf46d18f1a21b30aa3ed85,

title = "Fast algorithms for approximating distances",

abstract = "In this paper we present efficient approximation algorithms for the distance selection problem. Our technique is based on the well-separated pair decomposition proposed in [8].",

keywords = "Approximation algorithms, Distance selection problem, Well-separated pair decomposition",

author = "S. Bespamyatnikh and M. Segal",

year = "2002",

month = jan,

day = "1",

doi = "10.1007/s00453-001-0114-7",

language = "English",

volume = "33",

pages = "263--269",

journal = "Algorithmica",

issn = "0178-4617",

publisher = "Springer New York",

number = "2",

}

TY - JOUR

T1 - Fast algorithms for approximating distances

AU - Bespamyatnikh, S.

AU - Segal, M.

PY - 2002/1/1

Y1 - 2002/1/1

N2 - In this paper we present efficient approximation algorithms for the distance selection problem. Our technique is based on the well-separated pair decomposition proposed in [8].

AB - In this paper we present efficient approximation algorithms for the distance selection problem. Our technique is based on the well-separated pair decomposition proposed in [8].

KW - Approximation algorithms

KW - Distance selection problem

KW - Well-separated pair decomposition

UR - https://www.scopus.com/pages/publications/0141991840

U2 - 10.1007/s00453-001-0114-7

DO - 10.1007/s00453-001-0114-7

M3 - Article

AN - SCOPUS:0141991840

SN - 0178-4617

VL - 33

SP - 263

EP - 269

JO - Algorithmica

JF - Algorithmica

IS - 2

ER -

Fast algorithms for approximating distances

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this