The following pages link to (Q5302101):
Displayed 13 items.
- On some network design problems with degree constraints (Q355516) (← links)
- On generalizations of network design problems with degree bounds (Q378106) (← links)
- New approaches to multi-objective optimization (Q403670) (← links)
- Network design with weighted degree constraints (Q429670) (← links)
- Degree constrained node-connectivity problems (Q486998) (← links)
- A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids (Q1035684) (← links)
- Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
- Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands (Q3010423) (← links)
- Network-Design with Degree Constraints (Q3088102) (← links)
- Approximation Algorithms for Multi-budgeted Network Design Problems (Q3460712) (← links)
- Network Design with Weighted Degree Constraints (Q3605498) (← links)
- Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal (Q5501947) (← links)
- (Q5743495) (← links)