The \(b\)-branching problem in digraphs
From MaRDI portal
Publication:2192110
DOI10.1016/j.dam.2020.02.005zbMath1442.05076OpenAlexW3009395236MaRDI QIDQ2192110
Kenjiro Takazawa, Naoyuki Kamiyama, Naonori Kakimura
Publication date: 29 June 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.02.005
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (3)
Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs ⋮ The b‐bibranching problem: TDI system, packing, and discrete convexity ⋮ Complexity of packing common bases in matroids
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast cost scaling algorithm for submodular flow
- A note on disjoint arborescences
- Arc-disjoint in-trees in directed graphs
- Rooted \(k\)-connections in digraphs
- On two minimax theorems in graph
- A faster capacity scaling algorithm for minimum cost submodular flow
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Fast cycle canceling algorithms for minimum cost submodular flow
- Exact and approximation algorithms for weighted matroid intersection
- Integer round-up property for the chromatic number of some \(h\)-perfect graphs
- A generalized-polymatroid approach to disjoint common independent sets in two matroids
- On partitioning two matroids into common independent subsets
- On Maximal Independent Arborescence Packing
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
- Matroid Intersection
- Integer Rounding for Polymatroid and Branching Optimization Problems
- Two algorithms for weighted matroid intersection
- A weighted matroid intersection algorithm
- Matroid intersection algorithms
- AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"
- Disjoint Common Transversals and Exchange Structures
- Blocking Optimal k-Arborescences
- Packing rooted directed cuts in a weighted directed graph
- Fibonacci heaps and their uses in improved network optimization algorithms
- Matroid-Based Packing of Arborescences
- Arborescence Problems in Directed Graphs: Theorems and Algorithms
- Optimum branchings
- Combinatorial optimization. Theory and algorithms.
- Matrices and matroids for systems analysis
- On covering intersecting set-systems by digraphs
This page was built for publication: The \(b\)-branching problem in digraphs
