| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143372 | Operations Research Letters | 2006 | 8 Pages |
Abstract
We study a class of graph problems which includes as special cases the Held and Karp 1-tree problem, and the minimum spanning tree problem with one degree constraint studied by Glover and Klingman. For another special case, we note a mistake in a paper by Ramesh, Yoon and Karwan.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Andreas Westerlund, Maud Göthe-Lundgren, Torbjörn Larsson,