Unexplored Steiner ratios in geometric networks

DOI10.1007/978-3-642-32241-9_24zbMATH Open1364.68342OpenAlexW160806678MaRDI QIDQ2914331FDOQ2914331

Authors: Paz Carmi, Lilach Chaitman-Yerushalmi 

Publication date: 25 September 2012

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

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.232.7505

Recommendations

• On the Steiner ratio in \(\mathcal R_n\)
• The Steiner ratio
• On Steiner ratio conjectures
• The Steiner ratio of several discrete metric spaces
• On better heuristics for Steiner minimum trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Cited In (2)

• An initial study of budgeted Steiner networks
• Optimizing budget allocation for center and median points

This page was built for publication: Unexplored Steiner ratios in geometric networks

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