scientific article; zbMATH DE number 7559245
From MaRDI portal
Publication:5088977
DOI10.4230/LIPIcs.SoCG.2019.45MaRDI QIDQ5088977
Diego Ihara, Neshat Mohammadi, Anastasios Sidiropoulos
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1807.04881
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Correlation clustering
- Quick approximation to matrices and applications
- Unit disk graph recognition is NP-hard
- The geometry of graphs and some of its algorithmic applications
- Monotone maps, sphericity and bounded second eigenvalue
- Metric Learning: A Survey
- Inapproximability for metric embeddings into $\mathbb{R}^{d}$
- Fitting Tree Metrics: Hierarchical Clustering and Phylogeny
- Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction
- A Treehouse with Custom Windows: Minimum Distortion Embeddings into Bounded Treewidth Graphs
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Ordinal embeddings of minimum relaxation
- Regularity Lemmas and Combinatorial Algorithms
- Excluded minors, network decomposition, and multicommodity flow
- Euclidean distortion and the sparsest cut
- Expander flows, geometric embeddings and graph partitioning
This page was built for publication:
