Pages that link to "Item:Q3503852"
From MaRDI portal
The following pages link to Degree Bounded Matroids and Submodular Flows (Q3503852):
Displaying 10 items.
- Packing Steiner trees (Q273179) (← links)
- On generalizations of network design problems with degree bounds (Q378106) (← links)
- Network design with weighted degree constraints (Q429670) (← links)
- A unified algorithm for degree bounded survivable network design (Q896300) (← links)
- A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids (Q1035684) (← links)
- Degree bounded matroids and submodular flows (Q2448960) (← links)
- Degree Bounded Forest Covering (Q3009772) (← links)
- Approximation-Friendly Discrepancy Rounding (Q3186517) (← links)
- Network Design with Weighted Degree Constraints (Q3605498) (← links)
- (Q5743495) (← links)