![]() |
@article{DBLP:journals/dam/ConnamacherP03,
author = {Harold S. Connamacher and
Andrzej Proskurowski},
title = {The complexity of minimizing certain cost metrics for k-source
spanning trees},
journal = {Discrete Applied Mathematics},
volume = {131},
number = {1},
year = {2003},
pages = {113-127},
ee = {http://dx.doi.org/10.1016/S0166-218X(02)00420-1},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2004-05-12 by Michael Ley (ley@uni-trier.de)