Hiroshi Nagamochi A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph. 77-95 2005 56 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2005.01.008 db/journals/jal/jal56.html#Nagamochi05