On minimum-weight \(k\)-edge connected Steiner networks on metric spaces

DOI10.1007/s003730070012zbMath0969.90088OpenAlexW2081159594MaRDI QIDQ1586581

Xiao-Dong Hu, Guo-Hui Lin, D. Frank Hsu

Publication date: 4 October 2001

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003730070012

zbMATH Keywords

weightSteiner networkminimum-weight \(k\)-edge

Mathematics Subject Classification ID

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

Related Items (2)

On minimally \(k\)-edge-connected graphs and shortest \(k\)-edge-connected Steiner networks ⋮ Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane

This page was built for publication: On minimum-weight \(k\)-edge connected Steiner networks on metric spaces