Approximation schemes for k-facility location
From MaRDI portal
Publication:6168971
DOI10.1007/978-3-031-22105-7_43MaRDI QIDQ6168971FDOQ6168971
Publication date: 10 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Greedy Strikes Back: Improved Facility Location Algorithms
- Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
- A new approximation algorithm for the \(k\)-facility location problem
- Adaptive Sampling for k-Means Clustering
- Primal-dual algorithms for connected facility location problems
- A Dependent LP-Rounding Approach for the k-Median Problem
- Approximation algorithms for hard capacitated \(k\)-facility location problems
- On stochastic \(k\)-facility location
- On k-Median clustering in high dimensions
- A constant-factor approximation algorithm for the \(k\)-median problem
- 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
- Title not available (Why is that?)
- Optimal terminal dimensionality reduction in Euclidean space
- Title not available (Why is that?)
Cited In (9)
- Title not available (Why is that?)
- Facility Location with Matroid or Knapsack Constraints
- An approximation algorithm for the \(k\)-level capacitated facility location problem
- An efficient approximation algorithm for the extension facility location problem on torus internetwork topology
- Title not available (Why is that?)
- Approximation of solutions for location problems
- An approximation algorithm for the \(k\)-level stochastic facility location problem
- An approximation framework for bounded facility location problems
- Approximation algorithms for \(k\)-level stochastic facility location problems
This page was built for publication: Approximation schemes for \(k\)-facility location
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6168971)
