Approximate Range Queries for Clustering

DOI10.4230/LIPIcs.SoCG.2018.62zbMath1489.68369arXiv1803.03978OpenAlexW2963509702MaRDI QIDQ5116522

Eunjin Oh, Hee-Kap Ahn

Publication date: 18 August 2020

Full work available at URL: https://arxiv.org/abs/1803.03978

zbMATH Keywords

orthogonal range queriesapproximate clustering

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data structures for range-aggregate extent queries
• Smaller coresets for \(k\)-median and \(k\)-means clustering
• Dynamic fractional cascading
• Clustering to minimize the maximum intercluster distance
• Making data structures persistent
• Exact and approximation algorithms for clustering
• 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
• Range-clustering queries
• Local Search Heuristics for k-Median and Facility Location Problems
• Approximate geometric MST range queries
• A unified framework for approximating and clustering data

This page was built for publication: Approximate Range Queries for Clustering