Low-dimensional embedding with extra information

DOI10.1145/997817.997866zbMath1374.68639OpenAlexW2043553510MaRDI QIDQ5361686

Erik D. Demaine, Mihai Bădoiu, Piotr Indyk, Mohammad Taghi Hajiaghayi

Publication date: 29 September 2017

Published in: Proceedings of the twentieth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/997817.997866

zbMATH Keywords

distributionapproximation algorithmsmetricsgraph embeddingorder typeanglesrange graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (5)

\(\ell ^2_2\) spreading metrics for vertex ordering problems ⋮ Theory of semidefinite programming for sensor network localization ⋮ Algorithmic Aspects of Sensor Localization ⋮ Managing cohort movement of mobile sensors via GPS-free and compass-free node localization ⋮ A linear-space algorithm for distance preserving graph embedding

This page was built for publication: Low-dimensional embedding with extra information