Pages that link to "Item:Q4360134"
From MaRDI portal
The following pages link to A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees (Q4360134):
Displaying 16 items.
- Degree-bounded minimum spanning tree for unit disk graph (Q764345) (← links)
- A 4-approximation of the \(\frac{2\pi }{3} \)-MST (Q832851) (← links)
- Network design with edge-connectivity and degree constraints (Q839639) (← links)
- Cooperative TSP (Q982655) (← links)
- Resource allocation in bounded degree trees (Q1024215) (← links)
- Degree-bounded minimum spanning trees (Q1028423) (← links)
- Approximating bounded-degree spanning trees and connected factors with leaves (Q1728165) (← links)
- Approximation algorithms for connected graph factors of minimum weight (Q1743127) (← links)
- Algorithms for the metric ring star problem with fixed edge-cost ratio (Q2051906) (← 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)
- Electrical flows over spanning trees (Q2097649) (← links)
- On improved bounds for bounded degree spanning trees for points in arbitrary dimension (Q2250052) (← links)
- Using Lagrangian dual information to generate degree constrained spanning trees (Q2489896) (← links)
- (Q4645917) (redirect page) (← links)
