Pages that link to "Item:Q4542527"
From MaRDI portal
The following pages link to Approximation schemes for Euclidean \(k\)-medians and related problems (Q4542527):
Displaying 19 items.
- (Q5091192) (← links)
- Approximating the distribution of the median and other robust estimators on uncertain data (Q5115783) (← links)
- Exact Algorithms and Lower Bounds for Stable Instances of Euclidean <i>k</i>-MEANS (Q5236376) (← links)
- Facility Location with Matroid or Knapsack Constraints (Q5252229) (← links)
- A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q5376438) (← links)
- Approximating k-median via pseudo-approximation (Q5495862) (← links)
- (Q5874516) (← links)
- On efficient connectivity-preserving transformations in a grid (Q5918321) (← links)
- \(k\)-median: exact recovery in the extended stochastic ball model (Q6044983) (← links)
- Improved approximations for Euclidean <i>k</i> -means and <i>k</i> -median, via nested quasi-independent sets (Q6083617) (← links)
- FPT Approximation for Constrained Metric k-Median/Means (Q6089659) (← links)
- A Modern View on Stability of Approximation (Q6163638) (← links)
- Lossy kernelization of same-size clustering (Q6174654) (← links)
- Approximation algorithms for fair \(k\)-median problem without fairness violation (Q6185845) (← links)
- A generalized \(k\)-means problem for clustering and an ADMM-based \(k\)-means algorithm (Q6536959) (← links)
- Local search yields a PTAS for fixed-dimensional \(k\)-means problem with penalties (Q6566778) (← links)
- A PTAS framework for clustering problems in doubling metrics (Q6591490) (← links)
- Approximation algorithms for robust clustering problems using local search techniques (Q6636083) (← links)
- FPT approximation for capacitated clustering with outliers (Q6658317) (← links)