scientific article; zbMATH DE number 2079382
From MaRDI portal
Publication:4471341
zbMATH Open1092.68690MaRDI QIDQ4471341FDOQ4471341
Authors: Venkatesan Guruswami, Piotr Indyk 
Publication date: 28 July 2004
Title of this publication is not available (Why is that?)
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)
- A unified framework for clustering constrained data without locality property
- Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1]
- Approximation and inapproximability results for maximum clique of disc graphs in high dimensions
- Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space
- Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics
- Faster balanced clusterings in high dimension
- Nonrealizability proofs in computational geometry
- Clustering through continuous facility location problems
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension
- Title not available (Why is that?)
- Inapproximability for planar embedding problems
- Title not available (Why is that?)
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)
