Breaching the 2 LMP approximation barrier for facility location with applications to k-median
From MaRDI portal
Publication:6538566
Cited in
(17)- A PTAS framework for clustering problems in doubling metrics
- k-median/means with outliers revisited: a simple fpt approximation
- FPT approximation for capacitated clustering with outliers
- An o( n)-approximation for submodular facility location
- On equivalence of parameterized inapproximability of k-median, k-max-coverage, and 2-CSP
- Clustering under a knapsack constraint: parameterized approximation for the knapsack median problem
- Polynomial-time approximation schemes for facility location on planar graphs
- The price of hierarchical clustering
- Improved approximation algorithm for capacitated facility location with uniform facility cost
- Structural iterative rounding for generalized k-median problems
- Separating \(k\)-\textsc{Median} from the supplier version
- On the budgeted priority p-median problem in high-dimensional Euclidean spaces
- On equivalence of parameterized inapproximability of \(k\)-median, \(k\)-max-coverage, and 2-CSP
- When far is better: the Chamberlin-Courant approach to obnoxious committee selection
- Parameterized approximation schemes for fair-range clustering
- Dimension-free parameterized approximation schemes for hybrid clustering
- A resonance neural network for the k-median problem
This page was built for publication: Breaching the 2 LMP approximation barrier for facility location with applications to \(k\)-median
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538566)
