Efficient 2-Approximation Algorithms for Computing 2-Connected Steiner Minimal Networks

DOI10.1109/TC.2011.123MaRDI QIDQ5274672zbMATH OpenOpenAlexFDO

Authors Hong Shen, Longkun Guo

Publication date 12 July 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2011.123

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Cited in

(1)

• The bottleneck 2-connected k-Steiner network problem for k 2

This page was built for publication: Efficient 2-Approximation Algorithms for Computing 2-Connected Steiner Minimal Networks

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