Pages that link to "Item:Q1869938"
From MaRDI portal
The following pages link to A constant-factor approximation algorithm for the \(k\)-median problem (Q1869938):
Displaying 31 items.
- Facility Location Problems: A Parameterized View (Q3511428) (← links)
- (Q4228499) (← links)
- Approximation schemes for Euclidean \(k\)-medians and related problems (Q4542527) (← links)
- (Q4675629) (← links)
- Interpolating between \(k\)-median and \(k\)-center: approximation algorithms for ordered \(k\)-median (Q5002699) (← links)
- (Q5002778) (← links)
- Simpler and Better Algorithms for Minimum-Norm Load Balancing (Q5075764) (← links)
- (Q5091191) (← links)
- (Q5091192) (← links)
- Covering a compact space by fixed-radius or growing random balls (Q5093989) (← links)
- Discrete facility location in machine learning (Q5100135) (← links)
- Facility Location with Matroid or Knapsack Constraints (Q5252229) (← links)
- A Constant Factor Approximation Algorithm for Fault-Tolerant <i>k</i>-Median (Q5383960) (← links)
- Approximating k-median via pseudo-approximation (Q5495862) (← links)
- (Q5743439) (← links)
- Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks (Q5853723) (← links)
- (Q5874473) (← links)
- (Q5874528) (← links)
- (Q5874534) (← links)
- A local search approximation algorithm for a squared metric \(k\)-facility location problem (Q5916060) (← links)
- Approximation algorithms for hierarchical location problems (Q5920573) (← links)
- \(k\)-median: exact recovery in the extended stochastic ball model (Q6044983) (← links)
- Effective Heuristic Techniques for Combined Robust Clustering Problem (Q6053497) (← links)
- Approximation algorithms for the individually fair \(k\)-center with outliers (Q6064038) (← links)
- A unified framework of FPT approximation algorithms for clustering problems (Q6065394) (← links)
- FPT Approximation for Constrained Metric k-Median/Means (Q6089659) (← links)
- Parameterized complexity of categorical clustering with size constraints (Q6098152) (← links)
- Improved bounds for metric capacitated covering problems (Q6107884) (← links)
- On coresets for fair clustering in metric and Euclidean spaces and their applications (Q6152182) (← links)
- Lossy kernelization of same-size clustering (Q6174654) (← links)
- Approximation algorithms for robust clustering problems using local search techniques (Q6636083) (← links)
