Pages that link to "Item:Q3149894"
From MaRDI portal
The following pages link to A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees (Q3149894):
Displayed 6 items.
- 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)
- Design and Analysis of Optimization Algorithms Using Computational Statistics (Q3159469) (← links)
- Approximating Directed Weighted-Degree Constrained Networks (Q3541798) (← links)
- On Lagrangian Relaxation and Subset Selection Problems (Q3602837) (← links)
- Network Design with Weighted Degree Constraints (Q3605498) (← links)