Approximation schemes for \(k\)-facility location
From MaRDI portal
Publication:6168971
DOI10.1007/978-3-031-22105-7_43MaRDI QIDQ6168971
Publication date: 10 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme
- A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem
- An approximation algorithm for soft capacitated \(k\)-facility location problem
- A constant-factor approximation algorithm for the \(k\)-median problem
- Primal-dual algorithms for connected facility location problems
- On stochastic \(k\)-facility location
- A new approximation algorithm for the \(k\)-facility location problem
- Approximation algorithms for hard capacitated \(k\)-facility location problems
- A Dependent LP-Rounding Approach for the k-Median Problem
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- On k-Median clustering in high dimensions
- Adaptive Sampling for k-Means Clustering
- Greedy Strikes Back: Improved Facility Location Algorithms
- Optimal terminal dimensionality reduction in Euclidean space
- Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
This page was built for publication: Approximation schemes for \(k\)-facility location
