The Held-Karp algorithm and degree-constrained minimum 1-trees
From MaRDI portal
Cites work
- A PRIMAL APPROACH TO THE INDEPENDENT ASSIGNMENT PROBLEM
- AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"
- scientific article; zbMATH DE number 3485511 (Why is no real title available?)
- Matroid intersection algorithms
- Matroids and the greedy algorithm
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Some Abstract Pivot Algorithms
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees. II
Cited in
(6)- A Lagrangean approach to the degree-constrained minimum spanning tree problem
- Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs.
- Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length
- A multiperiod degree constrained minimal spanning tree problem
- Design of capacitated degree constrained min-sum arborescence
- A note on relatives to the Held and Karp 1-tree problem
This page was built for publication: The Held-Karp algorithm and degree-constrained minimum 1-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4168404)