ISSN:
1436-4646
Keywords:
Traveling-Salesman Problem
;
1-tree
;
Matroid
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01609023
Permalink