ISSN:
1436-4646
Schlagwort(e):
Traveling-Salesman Problem
;
1-tree
;
Matroid
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Informatik
,
Mathematik
Notizen:
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.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/BF01609023
Permalink