Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction

DOI10.1007/978-3-540-85363-3_3zbMath1159.68043OpenAlexW1560003067MaRDI QIDQ3541784

Mihai Bădoiu, Erik D. Demaine, Morteza Zadimoghaddam, Anastasios Sidiropoulos, Mohammad Taghi Hajiaghayi

Publication date: 27 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85363-3_3

Mathematics Subject Classification ID

Distance in graphs (05C12) Approximation algorithms (68W25)

Related Items (5)

Unnamed Item ⋮ Betweenness parameterized above tight lower bound ⋮ An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs ⋮ Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs ⋮ Unnamed Item

This page was built for publication: Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction