Approximating k-median via pseudo-approximation
From MaRDI portal
Recommendations
- Approximating k-median via pseudo-approximation
- Approximation Algorithms for the k-Median Problem
- An Approximation Algorithm for the k-Median Problem with Uniform Penalties via Pseudo-Solutions
- scientific article; zbMATH DE number 2090269
- An approximation algorithm for the \(k\)-median problem with uniform penalties via pseudo-solution
- Approximation algorithms for the lower-bounded \(k\)-median and its generalizations
- scientific article; zbMATH DE number 1775394
- Approximating k-median with non-uniform capacities
- A constant-factor approximation algorithm for the k-median problem
- A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem
Cited in
(42)- Network cross-validation for determining the number of communities in network data
- An approximation algorithm for the \(k\)-median problem with uniform penalties via pseudo-solution
- An approximation algorithm for soft capacitated k-facility location problem
- An improved approximation algorithm for knapsack median using sparsification
- LP-based approximation for uniform capacitated facility location problem
- The ordered \(k\)-median problem: surrogate models and approximation algorithms
- Consistency of spectral clustering in stochastic block models
- Approximation algorithms for hard capacitated \(k\)-facility location problems
- Approximating k-median via pseudo-approximation
- A dependent LP-rounding approach for the k-median problem
- An Approximation Algorithm for the k-Median Problem with Uniform Penalties via Pseudo-Solutions
- LP-based algorithms for capacitated facility location
- Integrality gaps for strengthened linear relaxations of capacitated facility location
- An approximation algorithm for uniform capacitated k-median problem with 1+ capacity violation
- Improved algorithms for joint optimization of facility locations and network connections
- Finding the Median (Obliviously) with Bounded Space
- Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median
- An improved approximation algorithm for knapsack median using sparsification
- A streaming algorithm for k-means with approximate coreset
- Local search yields a PTAS for \(k\)-means in doubling metrics
- Recent developments in approximation algorithms for facility location and clustering problems
- A Lottery Model for Center-Type Problems With Outliers
- Interpolating between \(k\)-median and \(k\)-center: approximation algorithms for ordered \(k\)-median
- Constant-Factor FPT Approximation for Capacitated k-Median
- scientific article; zbMATH DE number 7561535 (Why is no real title available?)
- Discrete facility location in machine learning
- Facility Location with Matroid or Knapsack Constraints
- An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization
- Approximation algorithms for clustering with dynamic points
- Universal Algorithms for Clustering Problems
- Improved approximations for Euclidean k -means and k -median, via nested quasi-independent sets
- FPT Approximation for Constrained Metric k-Median/Means
- Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median
- An approximation algorithm for the parity-constrained k-supplier problem
- Improved approximation algorithm for capacitated facility location with uniform facility cost
- Robust facility leasing problem with penalties
- Parity-constrained k-supplier problem
- Separating \(k\)-\textsc{Median} from the supplier version
- Universal algorithms for clustering problems
- A resonance neural network for the k-median problem
- Centrality of trees for capacitated \(k\)-center
- Recovery guarantees for exemplar-based clustering
This page was built for publication: Approximating k-median via pseudo-approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495862)
