|
|||||
|
|
A note on relatives to the Held and Karp 1-tree problem |
|
| Authors: | Andreas Westerlund Maud Göthe-Lundgren Torbjörn Larsson |
| Institution: | Department of Mathematics, Linköping University, SE-581 83 Linköping, Sweden |
| 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: | 1-Tree problem Degree constraint Counter-example Polynomial time-complexity Vehicle routing Traveling salesman |
| 本文献已被 ScienceDirect 等数据库收录！ | |