On clustering with discounts
From MaRDI portal
Publication:2671820
DOI10.1016/j.ipl.2022.106272OpenAlexW4224239013MaRDI QIDQ2671820
Publication date: 3 June 2022
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.09505
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matroid and knapsack center problems
- Clustering to minimize the maximum intercluster distance
- Easy and hard bottleneck location problems
- Approximating $k$-Median via Pseudo-Approximation
- A Dependent LP-Rounding Approach for the k-Median Problem
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- A new greedy approach for facility location problems
- A Best Possible Heuristic for the k-Center Problem
- Local Search Heuristics for k-Median and Facility Location Problems
- Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms
- Approximation algorithms for minimum norm and ordered optimization problems
- Constant approximation for k-median and k-means with outliers via iterative rounding
This page was built for publication: On clustering with discounts
