Pages that link to "Item:Q1028423"
From MaRDI portal
The following pages link to Degree-bounded minimum spanning trees (Q1028423):
Displaying 12 items.
- On the area requirements of Euclidean minimum spanning trees (Q390122) (← links)
- Bounded-angle spanning tree: modeling networks with angular constraints (Q513267) (← links)
- Polynomial area bounds for MST embeddings of trees (Q654291) (← links)
- A 4-approximation of the \(\frac{2\pi }{3} \)-MST (Q832851) (← links)
- Degree-bounded minimum spanning trees (Q1028423) (← links)
- A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids (Q1035684) (← links)
- Euclidean bottleneck bounded-degree spanning tree ratios (Q2066315) (← links)
- Bounded-angle minimum spanning trees (Q2072102) (← links)
- A 4-approximation of the \(\frac{ 2 \pi}{ 3} \)-MST (Q2088886) (← links)
- What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs (Q2391179) (← links)
- An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem (Q2467447) (← links)
- Algorithms for Euclidean Degree Bounded Spanning Tree Problems (Q5197492) (← links)
