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. Theoretical Computer Science, 326(1-3):137-153, 2004. [doi]

Abstract

Abstract is missing.