On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality.

Hans-Joachim Böckenhauer Dirk Bongartz Juraj Hromkovic Ralf Klasing Guido Proietti Sebastian Seibert Walter Unger On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality. 59-70 2002 conf/fsttcs/2002 FSTTCS http://link.springer.de/link/service/series/0558/bibs/2556/25560059.htm db/conf/fsttcs/fsttcs2002.html#BockenhauerBHKPSU02