Variations for Lovász’ Submodular Ideas

DOI10.1007/978-3-540-85221-6_4zbMath1163.05017OpenAlexW57101987MaRDI QIDQ3601919

Kristóf Bérczi, András Frank

Publication date: 12 February 2009

Published in: Bolyai Society Mathematical Studies (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.718.2527

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (11)

Stronger bounds and faster algorithms for packing in generalized kernel systems ⋮ Reachability in arborescence packings ⋮ On reachability mixed arborescence packing ⋮ A Survey on Covering Supermodular Functions ⋮ The root location problem for arc-disjoint arborescences ⋮ Packing of maximal independent mixed arborescences ⋮ Packing branchings under cardinality constraints on their root sets ⋮ Old and new results on packing arborescences in directed hypergraphs ⋮ A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph ⋮ Packing in generalized kernel systems: a framework that generalizes packing of branchings ⋮ Covering Intersecting Bi-set Families under Matroid Constraints

This page was built for publication: Variations for Lovász’ Submodular Ideas