Two-connected Steiner networks: structural properties

DOI10.1016/j.orl.2004.07.010zbMath1090.90021OpenAlexW1972763846MaRDI QIDQ2488236

Martin Zachariasen, Pawel Winter

Publication date: 25 August 2005

Published in: Operations Research Letters (Search for Journal in Brave)

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

zbMATH Keywords

2-connected Steiner networksSurvivable networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (7)

New pruning rules for the Steiner tree problem and 2-connected Steiner network problem ⋮ Bounding component sizes of two-connected Steiner networks ⋮ Simplifying obstacles for Steiner network problems in the plane ⋮ Structural properties of minimum multi-source multi-sink Steiner networks in the Euclidean plane ⋮ Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane ⋮ Computing minimum 2‐edge‐connected Steiner networks in the Euclidean plane ⋮ Relay placement for two-connectivity

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum-weight two-connected spanning networks
• A proof of the Gilbert-Pollak conjecture on the Steiner ratio
• On the structure and complexity of the 2-connected Steiner network problem in the plane
• On shortest two-connected Steiner networks with Euclidean distance

This page was built for publication: Two-connected Steiner networks: structural properties