Pages that link to "Item:Q1661907"
From MaRDI portal
The following pages link to A generalization of the minimum branch vertices spanning tree problem (Q1661907):
Displaying 18 items.
- Bounded-degree spanning tree problems: models and new algorithms (Q632386) (← links)
- Additivity in minimum cost spanning tree problems (Q999732) (← links)
- Solving the 2-rooted mini-max spanning forest problem by branch-and-bound (Q1043334) (← links)
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem (Q1652257) (← links)
- Upgrading min-max spanning tree problem under various cost functions (Q1680539) (← links)
- An exact and heuristic approach for the \(d\)-minimum branch vertices problem (Q1756586) (← links)
- The generalized minimum branch vertices problem: properties and polyhedral analysis (Q2031951) (← links)
- Scatter search for the minimum leaf spanning tree problem (Q2147145) (← links)
- Minimizing branching vertices in distance-preserving subgraphs (Q2330556) (← links)
- An axiomatic approach in minimum cost spanning tree problems with groups (Q2348765) (← links)
- Cutting-plane-based algorithms for two branch vertices related spanning tree problems (Q2357824) (← links)
- An edge-swap heuristic for generating spanning trees with minimum number of branch vertices (Q2448195) (← links)
- On recursive computation of minimum spanning trees for special partial graphs (Q3690607) (← links)
- (Q3741632) (← links)
- (Q4448919) (← links)
- Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm (Q4679783) (← links)
- (Q5392237) (← links)
- An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth (Q6201339) (← links)
