Fast algorithms for approximating distances

DOI10.1007/S00453-001-0114-7MaRDI QIDQ1601023zbMATH OpenOpenAlexFDO

Authors Sergei Bespamyatnikh, Michael Segal

Publication date 17 June 2002

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-001-0114-7

zbMATH Keywords

distance selection problemwell-separated pair decomposition

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 2038782
• scientific article; zbMATH DE number 2149349
• Faster Approximation of Distances in Graphs
• ON ENUMERATING AND SELECTING DISTANCES
• Sublinear time algorithms for metric space problems

Cited in

(5)

• The Euclidean bottleneck Steiner path problem and other applications of ( , )-pair decomposition
• scientific article; zbMATH DE number 1246408 (Why is no real title available?)
• scientific article; zbMATH DE number 2038782 (Why is no real title available?)
• An efficient algorithm for computing free distance (Corresp.)
• A fast robust algorithm for computing discrete Voronoi diagrams

This page was built for publication: Fast algorithms for approximating distances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1601023)