Stronger bounds and faster algorithms for packing in generalized kernel systems
From MaRDI portal
Publication:312660
DOI10.1007/s10107-015-0948-4zbMath1356.90125OpenAlexW2276735181MaRDI QIDQ312660
Publication date: 16 September 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-015-0948-4
Combinatorial optimization (90C27) Combinatorial aspects of packing and covering (05B40) Numerical analysis (educational aspects) (97N40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fractional packing in ideal clutters
- A faster algorithm for packing branchings in digraphs
- A note on disjoint arborescences
- Polyhedra with the integer Carathéodory property
- Rooted \(k\)-connections in digraphs
- An integer analogue of Carathéodory's theorem
- Directed cut transversal packing for source-sink connected graphs
- On two minimax theorems in graph
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs
- Increasing the rooted connectivity of a digraph by one
- Improved bound for the Carathéodory rank of the bases of a matroid
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Packing in generalized kernel systems: a framework that generalizes packing of branchings
- Variations for Lovász’ Submodular Ideas
- Min-max Relations for Directed Graphs
- A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
- Fractional Packing ofT-Joins
- On covering intersecting set-systems by digraphs
- Integral packing of branchings in capacitaded digraphs
This page was built for publication: Stronger bounds and faster algorithms for packing in generalized kernel systems
