Pages that link to "Item:Q3613758"
From MaRDI portal
The following pages link to Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs (Q3613758):
Displayed 5 items.
- A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids (Q1035684) (← links)
- Spanning trees with minimum weighted degrees (Q2380008) (← 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)
- Network Design with Weighted Degree Constraints (Q3605498) (← links)
