On shortest three-edge-connected Steiner networks with Euclidean distance

DOI10.1016/S0166-218X(99)00222-XzbMath1015.90081OpenAlexW1989908700MaRDI QIDQ1570830

D. Frank Hsu, Xiao-Dong Hu

Publication date: 29 July 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00222-x

zbMATH Keywords

polynomial-time approximation schemeSteiner network

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Minimum-weight two-connected spanning networks
• An efficient algorithm for determining the convex hull of a finite planar set
• On the Structure of Minimum-Weight k-Connected Spanning Networks
• Convexity and the Steiner tree problem
• On Steiner Minimal Trees with Rectilinear Distance
• On shortest two-connected Steiner networks with Euclidean distance
• Steiner tree problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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