Ordinal embeddings of minimum relaxation
From MaRDI portal
Publication:4962751
DOI10.1145/1383369.1383377zbMath1445.68182WikidataQ59701034 ScholiaQ59701034MaRDI QIDQ4962751
Noga Alon, Martín Farach-Colton, Mihai Bădoiu, Anastasios Sidiropoulos, Erik D. Demaine, Mohammad Taghi Hajiaghayi
Publication date: 5 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1383369.1383377
05C05: Trees
05C12: Distance in graphs
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
68R12: Metric embeddings as related to computational problems and algorithms
Related Items
Unnamed Item, FPT-Algorithms for Computing Gromov-Hausdorff and Interleaving Distances Between Trees, Unnamed Item, Characterization and representation problems for intersection betweennesses, Space lower bounds for low-stretch greedy embeddings, Betweenness parameterized above tight lower bound, On subbetweennesses of trees: hardness, algorithms, and characterizations