The following pages link to (Q5302102):
Displayed 9 items.
- New approaches to multi-objective optimization (Q403670) (← links)
- Approximating directed weighted-degree constrained networks (Q627195) (← links)
- A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids (Q1035684) (← links)
- Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← links)
- A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem (Q3541797) (← links)
- Approximating Directed Weighted-Degree Constrained Networks (Q3541798) (← links)
- Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees (Q3602825) (← links)
- Network Design with Weighted Degree Constraints (Q3605498) (← links)
- Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal (Q5501947) (← links)