scientific article; zbMATH DE number 7651196
From MaRDI portal
Publication:5874528
DOI10.4230/LIPIcs.ESA.2020.57MaRDI QIDQ5874528
Sagar Kale, Monika R. Henzinger
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2004.14891
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Fully dynamic \(k\)-center clustering with outliers ⋮ Fully dynamic \(k\)-center clustering with outliers ⋮ On coresets for support vector machines
Cites Work
- A local search approximation algorithm for \(k\)-means clustering
- Optimal time bounds for approximate clustering
- Smaller coresets for \(k\)-median and \(k\)-means clustering
- A constant-factor approximation algorithm for the \(k\)-median problem
- Approximating $k$-Median via Pseudo-Approximation
- Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- A new greedy approach for facility location problems
- On coresets for k-means and k-median clustering
- Coresets in dynamic geometric data streams
- Decomposable searching problems I. Static-to-dynamic transformation
- Sparsification—a technique for speeding up dynamic graph algorithms
- Local Search Heuristics for k-Median and Facility Location Problems
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- Improved Combinatorial Algorithms for Facility Location Problems
- A unified framework for approximating and clustering data
This page was built for publication:
