BibTeX
@article{DBLP:journals/tcs/BockenhauerBHKPSU04,
author = {Hans-Joachim B{\"o}ckenhauer and
Dirk Bongartz and
Juraj Hromkovic and
Ralf Klasing and
Guido Proietti and
Sebastian Seibert and
Walter Unger},
title = {On the hardness of constructing minimal 2-connected spanning
subgraphs in complete graphs with sharpened triangle inequality},
journal = {Theor. Comput. Sci.},
volume = {326},
number = {1-3},
year = {2004},
pages = {137-153},
ee = {http://dx.doi.org/10.1016/j.tcs.2004.06.019},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2004-11-22 by Michael Ley (ley@uni-trier.de)