Ordinal embeddings of minimum relaxation

DOI10.1145/1383369.1383377zbMath1445.68182OpenAlexW2149726280WikidataQ59701034 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

zbMATH Keywords

relaxationdistortionmetricsordinal embedding

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Metric embeddings as related to computational problems and algorithms (68R12)

Related Items (7)

Space lower bounds for low-stretch greedy embeddings ⋮ Characterization and representation problems for intersection betweennesses ⋮ On subbetweennesses of trees: hardness, algorithms, and characterizations ⋮ Unnamed Item ⋮ Betweenness parameterized above tight lower bound ⋮ Unnamed Item ⋮ FPT-Algorithms for Computing Gromov-Hausdorff and Interleaving Distances Between Trees

This page was built for publication: Ordinal embeddings of minimum relaxation