On shortest \(k\)-edge-connected Steiner networks in metric spaces

DOI10.1023/A:1009889023408zbMath1031.90055OpenAlexW1511580096MaRDI QIDQ1977864

Xiao-Dong Hu, Xiufeng Du, Xiao-Hua Jia

Publication date: 18 February 2004

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009889023408

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Approximation algorithms (68W25)

Related Items (1)

On minimally \(k\)-edge-connected graphs and shortest \(k\)-edge-connected Steiner networks

This page was built for publication: On shortest \(k\)-edge-connected Steiner networks in metric spaces