Space lower bounds for low-stretch greedy embeddings

DOI10.1007/978-3-642-31104-8_1zbMATH Open1333.68026OpenAlexW2114795527MaRDI QIDQ2913208FDOQ2913208

Authors: I. Caragiannis, Christos Kalaitzis 

Publication date: 26 September 2012

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31104-8_1

Recommendations

• Space lower bounds for low-stretch greedy embeddings
• Some results on greedy embeddings in metric spaces
• Greedy routing via embedding graphs onto semi-metric spaces
• Greedy Routing via Embedding Graphs onto Semi-metric Spaces
• Hyperbolic Embeddings for Near-Optimal Greedy Routing

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph representations (geometric and intersection representations, etc.) (05C62) Network design and communication in computer systems (68M10)

Cited In (3)

• Some results on greedy embeddings in metric spaces
• Approximation algorithms for low-distortion embeddings into low-dimensional spaces
• An optimal greedy routing algorithm for triangulated polygons

This page was built for publication: Space lower bounds for low-stretch greedy embeddings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2913208)