Pages that link to "Item:Q2391179"
From MaRDI portal
The following pages link to What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs (Q2391179):
Displaying 12 items.
- On generalizations of network design problems with degree bounds (Q378106) (← links)
- Network design with weighted degree constraints (Q429670) (← links)
- A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids (Q1035684) (← links)
- Chain-constrained spanning trees (Q1702777) (← links)
- Refuting a conjecture of goemans on bounded degree spanning trees (Q1709958) (← links)
- Approximating MIN-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems (Q1800987) (← links)
- The maximum binary tree problem (Q2041978) (← links)
- Bounded-degree light approximate shortest-path trees in doubling metrics (Q2235274) (← links)
- A 3/2-Approximation for the Metric Many-Visits Path TSP (Q5055644) (← links)
- Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal (Q5501947) (← links)
- (Q5743495) (← links)
- The Maximum Binary Tree Problem. (Q5874498) (← links)