Space Lower Bounds for Low-Stretch Greedy Embeddings

DOI10.1007/978-3-642-31104-8_1zbMath1333.68026OpenAlexW2114795527MaRDI QIDQ2913208

Christos Kalaitzis, Ioannis Caragiannis

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

Mathematics Subject Classification ID

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

Related Items (1)

An optimal greedy routing algorithm for triangulated polygons

This page was built for publication: Space Lower Bounds for Low-Stretch Greedy Embeddings