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

DOI10.1109/TC.2011.123zbMATH Open1365.05282OpenAlexW2084845325MaRDI QIDQ5274672

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)

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