Pages that link to "Item:Q5363039"
From MaRDI portal
The following pages link to An Improved Approximation for <i>k</i>-median, and Positive Correlation in Budgeted Optimization (Q5363039):
Displayed 33 items.
- Improved algorithms for joint optimization of facility locations and network connections (Q322548) (← links)
- Clustering through continuous facility location problems (Q346248) (← links)
- Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median (Q666661) (← links)
- A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem (Q1702823) (← links)
- An approximation algorithm for soft capacitated \(k\)-facility location problem (Q1702830) (← links)
- An improved approximation algorithm for knapsack median using sparsification (Q1751085) (← links)
- An approximation algorithm for stochastic multi-level facility location problem with soft capacities (Q2082185) (← links)
- To close is easier than to open: dual parameterization to \(k\)-median (Q2117693) (← links)
- On stochastic \(k\)-facility location (Q2151361) (← links)
- LP-based approximation for uniform capacitated facility location problem (Q2172086) (← links)
- The distance-constrained matroid median problem (Q2182102) (← links)
- Ordinal approximation for social choice, matching, and facility location problems given candidate positions (Q2190377) (← links)
- Polynomial time approximation schemes for clustering in low highway dimension graphs (Q2229951) (← links)
- Metric \(k\)-median clustering in insertion-only streams (Q2231758) (← links)
- Approximation algorithms for median hub location problems (Q2424817) (← links)
- Probabilistic analysis of optimization problems on generalized random shortest path metrics (Q2662688) (← links)
- Accurate Low-Space Approximation of Metric k-Median for Insertion-Only Streams (Q2971636) (← links)
- An Approximation Algorithm for Uniform Capacitated k-Median Problem with $$1+\epsilon $$ Capacity Violation (Q3186508) (← links)
- Approximation Algorithms for <i>D</i>-optimal Design (Q3387934) (← links)
- Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median (Q3448778) (← links)
- An Improved Approximation Algorithm for Knapsack Median Using Sparsification (Q3452792) (← links)
- Local Search Algorithms for k-Median and k-Facility Location Problems with Linear Penalties (Q3467834) (← links)
- Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics (Q4634032) (← links)
- A Lottery Model for Center-Type Problems With Outliers (Q4972682) (← links)
- (Q5002699) (← links)
- Constant-Factor FPT Approximation for Capacitated k-Median (Q5075732) (← links)
- (Q5091167) (← links)
- (Q5091192) (← links)
- Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms (Q5117377) (← links)
- (Q5874516) (← links)
- (Q5875522) (← links)
- A local search approximation algorithm for a squared metric \(k\)-facility location problem (Q5916060) (← links)
- Efficient algorithms for fair clustering with a new notion of fairness (Q6052264) (← links)