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):
Displaying 11 items.
- On generalizations of network design problems with degree bounds (Q378106) (← links)
- Network design with weighted degree constraints (Q429670) (← links)
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle (Q543415) (← links)
- A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids (Q1035684) (← links)
- Bounded-degree light approximate shortest-path trees in doubling metrics (Q2235274) (← 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)
- md-MST is NP-hard for \(d\geq 3\) (Q2883542) (← links)
- Network Design with Weighted Degree Constraints (Q3605498) (← links)
- Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal (Q5501947) (← links)
