Pages that link to "Item:Q4634032"
From MaRDI portal
The following pages link to Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics (Q4634032):
Displayed 23 items.
- The seeding algorithm for spherical \(k\)-means clustering with penalties (Q2082212) (← links)
- Lossy kernelization of same-size clustering (Q2097218) (← links)
- A refined approximation for Euclidean \(k\)-means (Q2122798) (← links)
- An improved approximation algorithm for capacitated correlation clustering problem (Q2149853) (← links)
- An improved approximation algorithm for squared metric \(k\)-facility location (Q2150578) (← links)
- An improved \((1+1)\) evolutionary algorithm for \(k\)-Median clustering problem with performance guarantee (Q2164835) (← links)
- An exact algorithm for stable instances of the \(k\)-means problem with penalties in fixed-dimensional Euclidean space (Q2165794) (← links)
- On the geometric set multicover problem (Q2167317) (← links)
- Constructing planar support for non-piercing regions (Q2207613) (← links)
- Quantum algorithms for similarity measurement based on Euclidean distance (Q2208001) (← links)
- A constant FPT approximation algorithm for hard-capacitated \(k\)-means (Q2218871) (← links)
- Polynomial time approximation schemes for clustering in low highway dimension graphs (Q2229951) (← links)
- Improved PTAS for the constrained \(k\)-means problem (Q2424715) (← links)
- Better guarantees for \(k\)-median with service installation costs (Q2672628) (← links)
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
- A Streaming Algorithm for k-Means with Approximate Coreset (Q4631688) (← links)
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension (Q5009565) (← links)
- Stability and Recovery for Independence Systems (Q5111712) (← links)
- (Q5214247) (← links)
- (Q5874516) (← links)
- Local search strikes again: PTAS for variants of geometric covering and packing (Q5919362) (← links)
- Secure delegated quantum algorithms for solving Mahalanobis distance (Q6167727) (← links)
- Lossy kernelization of same-size clustering (Q6174654) (← links)