|
|||||
|
|
The Held—Karp algorithm and degree-constrained minimum 1-trees |
|
| Authors: | Y Yamamoto |
| Institution: | (1) Keio University, Yokohama, Japan |
| Abstract: | In this note we propose to find a degree-constrained minimum 1-tree in the Held—Karp algorithm 5, 6] for the symmetric traveling-salesman problem, and show that it is reduced to finding a minimum common basis of two matroids. |
| Keywords: | Traveling-Salesman Problem 1-tree Matroid |
| 本文献已被 SpringerLink 等数据库收录！ | |