Pages that link to "Item:Q3601919"
From MaRDI portal
The following pages link to Variations for Lovász’ Submodular Ideas (Q3601919):
Displaying 11 items.
- Stronger bounds and faster algorithms for packing in generalized kernel systems (Q312660) (← links)
- The root location problem for arc-disjoint arborescences (Q442209) (← links)
- A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph (Q990080) (← links)
- Old and new results on packing arborescences in directed hypergraphs (Q1744239) (← links)
- Reachability in arborescence packings (Q2166224) (← links)
- Packing of maximal independent mixed arborescences (Q2217484) (← links)
- Packing branchings under cardinality constraints on their root sets (Q2225417) (← links)
- On reachability mixed arborescence packing (Q2419578) (← links)
- Packing in generalized kernel systems: a framework that generalizes packing of branchings (Q2515040) (← links)
- Covering intersecting bi-set families under matroid constraints (Q2820858) (← links)
- A Survey on Covering Supermodular Functions (Q2971606) (← links)