The following pages link to Low-degree minimum spanning trees (Q1895968):
Displaying 20 items.
- Improved approximation algorithms for single-tiered relay placement (Q266064) (← links)
- Relay placement for fault tolerance in wireless networks in higher dimensions (Q632722) (← links)
- Wireless network design via 3-decompositions (Q990943) (← links)
- Degree-bounded minimum spanning trees (Q1028423) (← links)
- The vertex degrees of minimum spanning trees (Q1580975) (← links)
- A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points (Q1607061) (← links)
- Approximating Steiner trees and forests with minimum number of Steiner points (Q1796259) (← links)
- New lower bounds for the Hadwiger numbers of \(\ell_p\) balls for \(p<2\) (Q1808462) (← links)
- Efficient minimum spanning tree construction with Delaynay triangulation (Q1847389) (← links)
- Kissing numbers and the centered maximal operator (Q1979231) (← links)
- Antipodal Hadwiger numbers of finite-dimensional Banach spaces (Q2042136) (← links)
- A unifying model for locally constrained spanning tree problems (Q2045044) (← links)
- Degree bounded bottleneck spanning trees in three dimensions (Q2292155) (← links)
- Relay placement for two-connectivity (Q2339829) (← links)
- Low-degree minimal spanning trees in normed spaces (Q2488684) (← links)
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations (Q2914198) (← links)
- Approximating Survivable Networks with Minimum Number of Steiner Points (Q3075458) (← links)
- Approximating Steiner Trees and Forests with Minimum Number of Steiner Points (Q3453286) (← links)
- A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees (Q4360134) (← links)
- Small degree out‐branchings (Q4805223) (← links)
