scientific article; zbMATH DE number 7651196
From MaRDI portal
Publication:5874528
DOI10.4230/LIPICS.ESA.2020.57MaRDI QIDQ5874528FDOQ5874528
Authors: Sagar Kale, Monika R. Henzinger 
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2004.14891
Title of this publication is not available (Why is that?)
Recommendations
Cites Work
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Improved Combinatorial Algorithms for Facility Location Problems
- A new greedy approach for facility location problems
- 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
- Approximating \(k\)-median via pseudo-approximation
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- Optimal time bounds for approximate clustering
- On coresets for k-means and k-median clustering
- A constant-factor approximation algorithm for the \(k\)-median problem
- Smaller coresets for \(k\)-median and \(k\)-means clustering
- A local search approximation algorithm for \(k\)-means clustering
- Coresets in dynamic geometric data streams
- A unified framework for approximating and clustering data
- Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
Cited In (5)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874528)
