Approximation algorithms for clustering with dynamic points
From MaRDI portal
Publication:2168849
DOI10.1016/j.jcss.2022.07.001OpenAlexW3037267309WikidataQ114162786 ScholiaQ114162786MaRDI QIDQ2168849
Jian Li, Shichuan Deng, Yuval Rabani
Publication date: 26 August 2022
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.14403
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matroid and knapsack center problems
- New approaches to multi-objective optimization
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Clustering to minimize the maximum intercluster distance
- Easy and hard bottleneck location problems
- Fault tolerant \(K\)-center problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A technique for obtaining true approximations for \(k\)-center with covering constraints
- The ordered \(k\)-median problem: surrogate models and approximation algorithms
- Complexity of approximating bounded variants of optimization problems
- Approximating $k$-Median via Pseudo-Approximation
- A Dependent LP-Rounding Approach for the k-Median Problem
- Minimizing movement
- Proof verification and the hardness of approximation problems
- Minimizing movement in mobile facility location problems
- A unified approach to scheduling on unrelated parallel machines
- Competitive algorithms for server problems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Reducibility Among Combinatorial Problems
- A new greedy approach for facility location problems
- A Best Possible Heuristic for the k-Center Problem
- On the k -server conjecture
- The Capacitated K-Center Problem
- Approximating capacitated k-median with (1 + ∊)k open facilities
- Local Search Heuristics for k-Median and Facility Location Problems
- A Constant Factor Approximation Algorithm for Fault-Tolerant k -Median
- Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications
- Dynamic Facility Location via Exponential Clocks
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- Fault-tolerant facility location
- A Lottery Model for Center-Type Problems With Outliers
- Generalized Center Problems with Outliers
- Fair Colorful k-Center Clustering
- Facility Location in Evolving Metrics
- Approximation algorithms for minimum norm and ordered optimization problems
- The online 𝑘-taxi problem
- Constant-factor approximation for ordered k-median
- Constant approximation for k-median and k-means with outliers via iterative rounding
- Local-Search based Approximation Algorithms for Mobile Facility Location Problems: (Extended Abstract)
- Online \(k\)-taxi via double coverage and time-reverse primal-dual
This page was built for publication: Approximation algorithms for clustering with dynamic points
