On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
Langue
en
Communication dans un congrès
Ce document a été publié dans
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality, On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality, Proc. of the 22nd Conference on Foundations of Software Technology and Theoretial Computer Science (FSTTCS 2002), 2002. 2002, vol. 2556, p. 59--70