Pages that link to "Item:Q3507519"
From MaRDI portal
The following pages link to A Nearly Linear-Time Approximation Scheme for the Euclidean <i>k</i>-Median Problem (Q3507519):
Displaying 23 items.
- Clustering through continuous facility location problems (Q346248) (← links)
- Some results on approximate 1-median selection in metric spaces (Q418725) (← links)
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing (Q494936) (← links)
- Local search algorithms for the red-blue median problem (Q692631) (← links)
- Approximating \(k\)-hop minimum spanning trees in Euclidean metrics (Q963410) (← links)
- Kinetic facility location (Q970606) (← links)
- An approximation algorithm for the Euclidean incremental median problem (Q1751197) (← links)
- Faster balanced clusterings in high dimension (Q2006774) (← links)
- \(\mathrm{M}^p\)UFLP: universal facility location problem in the \(p\)-th power of metric space (Q2197535) (← links)
- Parameterized \(k\)-clustering: tractability island (Q2221803) (← links)
- Polynomial time approximation schemes for clustering in low highway dimension graphs (Q2229951) (← links)
- A unified framework for clustering constrained data without locality property (Q2300724) (← links)
- Probabilistic \(k\)-median clustering in data streams (Q2344214) (← links)
- A PTAS for the geometric connected facility location problem (Q2408564) (← links)
- On some variants of Euclidean \(k\)-supplier (Q2670484) (← links)
- The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme (Q2817793) (← links)
- Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics (Q4634032) (← links)
- The Euclidean <i>k</i>-Supplier Problem (Q5108254) (← links)
- (Q5111721) (← links)
- (Q5874516) (← links)
- \(k\)-median: exact recovery in the extended stochastic ball model (Q6044983) (← links)
- Approximation algorithms for fair \(k\)-median problem without fairness violation (Q6185845) (← links)
- A PTAS framework for clustering problems in doubling metrics (Q6591490) (← links)