Pages that link to "Item:Q3196638"
From MaRDI portal
The following pages link to Polynomial-time approximation schemes for geometric min-sum median clustering (Q3196638):
Displaying 11 items.
- Parameterized complexity of categorical clustering with size constraints (Q832880) (← links)
- An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors (Q1026115) (← links)
- Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings (Q1711830) (← links)
- Parameterized low-rank binary matrix approximation (Q2218414) (← links)
- A Streaming Algorithm for k-Means with Approximate Coreset (Q4631688) (← links)
- Local Search Yields a PTAS for $k$-Means in Doubling Metrics (Q4634026) (← links)
- Parameterized Low-Rank Binary Matrix Approximation (Q5002728) (← links)
- (Q5009594) (← links)
- Tight Embeddability of Proper and Stable Metric Spaces (Q5262379) (← links)
- Low-Rank Binary Matrix Approximation in Column-Sum Norm. (Q6062156) (← links)
- Parameterized complexity of categorical clustering with size constraints (Q6098152) (← links)
