scientific article; zbMATH DE number 2079382
From MaRDI portal
Publication:4471341
Recommendations
- Inapproximability for metric embeddings into $\mathbb{R}^{d}$
- Embedding into \(l_{\infty }^{2}\) is easy, embedding into \(l_{\infty}^{3}\) is NP-complete
- Hardness of Embedding Metric Spaces of Equal Size
- scientific article; zbMATH DE number 6381680
- Approximating min-sum k -clustering in metric spaces
Cited in
(12)- Faster balanced clusterings in high dimension
- Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1]
- A unified framework for clustering constrained data without locality property
- Approximation and inapproximability results for maximum clique of disc graphs in high dimensions
- scientific article; zbMATH DE number 5971212 (Why is no real title available?)
- Clustering through continuous facility location problems
- scientific article; zbMATH DE number 5657421 (Why is no real title available?)
- Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension
- Inapproximability for planar embedding problems
- Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space
- Nonrealizability proofs in computational geometry
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471341)
