An efficient sum query algorithm for distance-based locally dominating functions

DOI10.4230/LIPIcs.ISAAC.2017.47zbMath1453.68064OpenAlexW2782820392MaRDI QIDQ5136267

Ziyun Huang, Jinhui Xu

Publication date: 25 November 2020

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/8248/pdf/LIPIcs-ISAAC-2017-47.pdf/

zbMATH Keywords

high dimensionsdata structuredistance-based functionlocal dominationsum query

Mathematics Subject Classification ID

Data structures (68P05) Approximation algorithms (68W25)

Cites Work

• On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
• On coresets for k-means and k-median clustering
• On Approximating the Depth and Related Problems
• Probability Inequalities for Sums of Bounded Random Variables
• Beyond Locality-Sensitive Hashing
• A unified framework for approximating and clustering data
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient sum query algorithm for distance-based locally dominating functions