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
Article de revue
This item was published in
Theoretical Computer Science. 2004-10, vol. 326, n° 1--3, p. 137--153
Elsevier
Origin
Hal imported