Approximation algorithms for geometric median problems
From MaRDI portal
Recommendations
Cites work
- A new polynomial-time algorithm for linear programming
- Clustering to minimize the maximum intercluster distance
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
Cited in
(41)- Joint object placement and node dimensioning for internet content distribution
- An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
- K-center and K-median problems in graded distances
- An approximation algorithm for the maximization version of the two level uncapacitated facility location problem
- An approximation algorithm for the \(k\)-median problem with uniform penalties via pseudo-solution
- Cluster editing problem for points on the real line: a polynomial time algorithm
- A constant-factor approximation algorithm for the k-median problem
- Clustering to minimize the sum of cluster diameters
- Approximating the \(\tau\)-relaxed soft capacitated facility location problem
- The ordered \(k\)-median problem: surrogate models and approximation algorithms
- Approximation algorithms for the fault-tolerant facility location problem with penalties
- Approximation algorithms for median hub location problems
- Cache placement in sensor networks under an update cost constraint
- Incremental medians via online bidding
- An approximate median search algorithm in non-metric spaces
- Approximating k-median via pseudo-approximation
- An Approximation Algorithm for the k-Median Problem with Uniform Penalties via Pseudo-Solutions
- An approximation algorithm for the continuous k-medians problem in a convex polygon
- LP-based algorithms for capacitated facility location
- A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- A Nearly Linear-Time Approximation Scheme for the Euclidean k-Median Problem
- A Lagrangean heuristic for the plant location problem with multiple facilities in the same site
- scientific article; zbMATH DE number 1775394 (Why is no real title available?)
- scientific article; zbMATH DE number 2090207 (Why is no real title available?)
- scientific article; zbMATH DE number 1416475 (Why is no real title available?)
- Better guarantees for \(k\)-means and Euclidean \(k\)-median by primal-dual algorithms
- Facility Location with Matroid or Knapsack Constraints
- Geometric median in nearly linear time
- Experimental and Efficient Algorithms
- Traffic-redundancy aware network design
- k-median: exact recovery in the extended stochastic ball model
- Approximation algorithms for the fault-tolerant facility location problem with submodular penalties
- Constant-factor approximation algorithms for some maximin multi-clustering problems
- Fully-scalable MPC algorithms for clustering in high dimension
- Local search algorithms for the red-blue median problem
- Online facility location with weights and congestion
- Improved polynomial-time approximations for clustering with minimum sum of radii or diameters
- Approximation algorithm for dynamic facility location problem
- Separating \(k\)-\textsc{Median} from the supplier version
- Facility location models for distribution system design
- Approximation algorithms for clustering with minimum sum of radii, diameters, and squared radii
This page was built for publication: Approximation algorithms for geometric median problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1209349)
