The following pages link to md-MST is NP-hard for \(d\geq 3\) (Q2883542):
Displaying 8 items.
- When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem (Q255267) (← links)
- A strong symmetric formulation for the min-degree constrained minimum spanning tree problem (Q325449) (← links)
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm (Q496663) (← links)
- NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem (Q860400) (← links)
- A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem (Q1728477) (← links)
- New genetic algorithm approach for the MIN-degree constrained minimum spanning tree (Q1751721) (← links)
- A unifying model for locally constrained spanning tree problems (Q2045044) (← links)
- The Euclidean degree-4 minimum spanning tree problem is NP-hard (Q5370716) (← links)
