On shortest two-connected Steiner networks with Euclidean distance

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199809)32:2<133::AID-NET6>3.0.CO;2-C" /><133::AID-NET6>3.0.CO;2-C 10.1002/(SICI)1097-0037(199809)32:2<133::AID-NET6>3.0.CO;2-CzbMath0990.05078OpenAlexW2004752601MaRDI QIDQ4540072

Xiao-Dong Hu, D. Frank Hsu

Publication date: 21 July 2002

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199809)32:2<133::aid-net6>3.0.co;2-c

zbMATH Keywords

Euclidean planepolynomial-time algorithmshortest two-connected Steiner network

Mathematics Subject Classification ID

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

Related Items (5)

Bounding component sizes of two-connected Steiner networks ⋮ Computing minimum 2‐edge‐connected Steiner networks in the Euclidean plane ⋮ On the structure and complexity of the 2-connected Steiner network problem in the plane ⋮ Two-connected Steiner networks: structural properties ⋮ On shortest three-edge-connected Steiner networks with Euclidean distance

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