On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
KLASING, Ralf
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
< Reduce
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Language
en
Communication dans un congrès
This item was published in
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
Origin
Hal imported