On the graph turnpike problem

DOI10.1016/j.ipl.2009.03.024zbMath1209.68583OpenAlexW2022268719MaRDI QIDQ989483

Tomás Feder, Rajeev Motwani

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.03.024

zbMATH Keywords

graph algorithmscomputational geometrygraph turnpike problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Efficient algorithms for network localization using cores of underlying graphs

Cites Work

• Approximating the bandwidth via volume respecting embeddings
• Improved Bandwidth Approximation for Trees and Chordal Graphs
• Embedding tree metrics into low dimensional Euclidean spaces
• Low-distortion embeddings of general metrics into the line
• A tight bound on approximating arbitrary metrics by tree metrics
• Unnamed Item
• Unnamed Item

This page was built for publication: On the graph turnpike problem