Bounding component sizes of two-connected Steiner networks
From MaRDI portal
Publication:2380015
DOI10.1016/j.ipl.2007.06.009zbMath1190.90088OpenAlexW1964027311MaRDI QIDQ2380015
Publication date: 24 March 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.06.009
Related Items (5)
New pruning rules for the Steiner tree problem and 2-connected Steiner network problem ⋮ Fixed parameter tractability of a biconnected bottleneck Steiner network problem ⋮ 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
- Minimum-weight two-connected spanning networks
- On the relationship between the biconnectivity augmentation and traveling salesman problems
- On the structure and complexity of the 2-connected Steiner network problem in the plane
- Two-connected Steiner networks: structural properties
- On shortest two-connected Steiner networks with Euclidean distance
- Unnamed Item
- Unnamed Item
This page was built for publication: Bounding component sizes of two-connected Steiner networks
