![]() |
@article{DBLP:journals/eccc/ECCC-TR98-025,
author = {Joseph Cheriyan and
Ramakrishna Thurimella},
title = {Approximating Minimum-Size k-Connected Spanning Subgraphs
via Matching},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {5},
number = {25},
year = {1998},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2006-06-30 by Michael Ley (ley@uni-trier.de)