Approximating Distance Measures for the Skyline
From MaRDI portal
Publication:5091120
DOI10.4230/LIPIcs.ICDT.2019.10OpenAlexW2907907018MaRDI QIDQ5091120
Gregory van Buskirk, Benjamin Raichel, Stavros Sintos, Nirman Kumar
Publication date: 21 July 2022
Full work available at URL: https://doi.org/10.4230/LIPIcs.ICDT.2019.10
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- L-infinity interdistance selection by parametric search
- Improved complexity bounds for location problems on the real line
- Geometric Spanner Networks
- Asymmetric k -center is log * n -hard to approximate
- A Greedy Heuristic for the Set-Covering Problem
- On Finding the Maxima of a Set of Vectors
- AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- Sparse Approximation via Generating Point Sets
- Efficient Algorithms for k-Regret Minimizing Sets
- Faster Approximation Algorithm for the k-Regret Minimizing Set and Related Problems
- Database Theory - ICDT 2005
- Orthogonal range searching on the RAM, revisited
- On the p‐coverage problem on the real line
- Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
This page was built for publication: Approximating Distance Measures for the Skyline
