On shortest two-connected Steiner networks with Euclidean distance

DOI10.1002/(SICI)1097-0037(199809)32:2%3C133::AID-NET6%3E3.0.CO;2-CMaRDI QIDQ4540072zbMATH OpenOpenAlexFDO

Authors D. Frank Hsu, Xiaodong Hu

Publication date 21 July 2002

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199809)32:2%3C133::aid-net6%3E3.0.co;2-c

zbMATH Keywords

polynomial-time algorithmEuclidean planeshortest two-connected Steiner network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35)

Recommendations

• On shortest three-edge-connected Steiner networks with Euclidean distance
• Minimum-weight two-connected spanning networks
• scientific article; zbMATH DE number 895361
• On better heuristics for Steiner minimum trees
• On the structure and complexity of the 2-connected Steiner network problem in the plane

Cited in

(11)

• Augmenting Euclidean Networks—the Steiner Case
• On minimum-weight \(k\)-edge connected Steiner networks on metric spaces
• Minimum-weight two-connected spanning networks
• Two-connected Steiner networks: structural properties
• On the structure and complexity of the 2-connected Steiner network problem in the plane
• scientific article; zbMATH DE number 1424552 (Why is no real title available?)
• Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane
• Bounding component sizes of two-connected Steiner networks
• Computing minimum 2-edge-connected Steiner networks in the Euclidean plane
• On shortest three-edge-connected Steiner networks with Euclidean distance
• Some New Structural Properties of Shortest 2-Connected Steiner Networks

This page was built for publication: On shortest two-connected Steiner networks with Euclidean distance

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