, Volume 15, Issue 1, pp 228-231

The Held—Karp algorithm and degree-constrained minimum 1-trees

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.