A Polynomial Algorithm for the Degree-Constrained Minimum K-Tree Problem
From MaRDI portal
Recommendations
- An algorithm for \(k^{\text{th}}\) minimum spanning tree
- The degree-constrained and diameter-constrained minimum spanning tree problem and its algorithm
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Approximating the Minimum-Degree Steiner Tree to within One of Optimal
- Research on the degree-constrained minimum spanning tree problem based on the Prim algorithm
Cited in
(14)- Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length
- A branch and bound algorithm for the exact solution of the problem of EMU circulation scheduling in railway network
- Stronger K-tree relaxations for the vehicle routing problem
- A polynomial algorithm for deciding the validity of an electrical distribution tree
- A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem
- A stabilized column generation scheme for the traveling salesman subtour problem
- A note on relatives to the Held and Karp 1-tree problem
- A new tabu search algorithm for the vehicle routing problem with backhauls
- An algorithm for \(k^{\text{th}}\) minimum spanning tree
- Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
- A polynomial algorithm for thep-centdian problem on a tree
- Approximation algorithms for solving the k-Chinese postman problem under interdiction budget constraints
- A tabu search algorithm for the open vehicle routing problem
- The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations
This page was built for publication: A Polynomial Algorithm for the Degree-Constrained Minimum K-Tree Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4319765)
