scientific article
From MaRDI portal
Publication:2768379
zbMath0988.65022MaRDI QIDQ2768379
Ashish Goel, Kasturi R. Varadarajan, Piotr Indyk
Publication date: 24 March 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
approximate bottleneck matchingapproximate diameterapproximate discrete centerapproximate furthest neighboursapproximate metric facility locationapproximate minimum weight matchinghigh dimensional proximity problemsnearest neighbour queriessubquadratic running time
Related Items (13)
An efficient algorithm for the smallest enclosing ball problem in high dimensions ⋮ Space exploration via proximity search ⋮ A branch-and-bound method for the minimum \(k\)-enclosing ball problem ⋮ No dimension-independent core-sets for containment under homothetics ⋮ Energy-efficient paths in radio networks ⋮ High-dimensional approximate \(r\)-nets ⋮ Optimal core-sets for balls ⋮ An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN ⋮ Efficient approximation algorithms for clustering point-sets ⋮ Approximate minimum enclosing balls in high dimensions using core-sets ⋮ Probabilistic smallest enclosing ball in high dimensions via subgradient sampling ⋮ Uncertainty quantification of the 4th kind; optimal posterior accuracy-uncertainty tradeoff with the minimum enclosing ball ⋮ Streaming algorithms for extent problems in high dimensions
This page was built for publication: