The \(b\)-branching problem in digraphs (Q2192110): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2020.02.005
+Normal rank
@@ Property / OpenAlex ID @@
+W3009395236
@@ Property / OpenAlex ID: W3009395236 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Rounding for Polymatroid and Branching Optimization Problems
+Normal rank
@@ Property / cites work @@
+Integer round-up property for the chromatic number of some \(h\)-perfect graphs
+Normal rank
@@ Property / cites work @@
+Blocking Optimal <i>k</i>-Arborescences
@@ Property / cites work: Blocking Optimal <i>k</i>-Arborescences / rank @@
+Normal rank
@@ Property / cites work @@
+Q5645231
@@ Property / cites work: Q5645231 / rank @@
+Normal rank
@@ Property / cites work @@
+Two algorithms for weighted matroid intersection
@@ Property / cites work: Two algorithms for weighted matroid intersection / rank @@
+Normal rank
@@ Property / cites work @@
+Q5567717
@@ Property / cites work: Q5567717 / rank @@
+Normal rank
@@ Property / cites work @@
+Disjoint Common Transversals and Exchange Structures
+Normal rank
@@ Property / cites work @@
+Matroid-Based Packing of Arborescences
@@ Property / cites work: Matroid-Based Packing of Arborescences / rank @@
+Normal rank
@@ Property / cites work @@
+Optimum branchings
@@ Property / cites work: Optimum branchings / rank @@
+Normal rank
@@ Property / cites work @@
+Q5684698
@@ Property / cites work: Q5684698 / rank @@
+Normal rank
@@ Property / cites work @@
+Matroid Intersection
@@ Property / cites work: Matroid Intersection / rank @@
+Normal rank
@@ Property / cites work @@
+Q4149476
@@ Property / cites work: Q4149476 / rank @@
+Normal rank
@@ Property / cites work @@
+A faster capacity scaling algorithm for minimum cost submodular flow
+Normal rank
@@ Property / cites work @@
+Q3858297
@@ Property / cites work: Q3858297 / rank @@
+Normal rank
@@ Property / cites work @@
+A weighted matroid intersection algorithm
@@ Property / cites work: A weighted matroid intersection algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Rooted \(k\)-connections in digraphs
@@ Property / cites work: Rooted \(k\)-connections in digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3085455
@@ Property / cites work: Q3085455 / rank @@
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+A note on disjoint arborescences
@@ Property / cites work: A note on disjoint arborescences / rank @@
+Normal rank
@@ Property / cites work @@
+Packing rooted directed cuts in a weighted directed graph
+Normal rank
@@ Property / cites work @@
+Q2921704
@@ Property / cites work: Q2921704 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact and approximation algorithms for weighted matroid intersection
+Normal rank
@@ Property / cites work @@
+AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"
+Normal rank
@@ Property / cites work @@
+A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
+Normal rank
@@ Property / cites work @@
+A fast cost scaling algorithm for submodular flow
@@ Property / cites work: A fast cost scaling algorithm for submodular flow / rank @@
+Normal rank
@@ Property / cites work @@
+Fast cycle canceling algorithms for minimum cost submodular flow
+Normal rank
@@ Property / cites work @@
+Q5005108
@@ Property / cites work: Q5005108 / rank @@
+Normal rank
@@ Property / cites work @@
+Arborescence Problems in Directed Graphs: Theorems and Algorithms
+Normal rank
@@ Property / cites work @@
+Arc-disjoint in-trees in directed graphs
@@ Property / cites work: Arc-disjoint in-trees in directed graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Maximal Independent Arborescence Packing
@@ Property / cites work: On Maximal Independent Arborescence Packing / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Theory and algorithms.
+Normal rank
@@ Property / cites work @@
+On partitioning two matroids into common independent subsets
+Normal rank
@@ Property / cites work @@
+Q5670638
@@ Property / cites work: Q5670638 / rank @@
+Normal rank
@@ Property / cites work @@
+Matroid intersection algorithms
@@ Property / cites work: Matroid intersection algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On two minimax theorems in graph
@@ Property / cites work: On two minimax theorems in graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q3035333
@@ Property / cites work: Q3035333 / rank @@
+Normal rank
@@ Property / cites work @@
+Matrices and matroids for systems analysis
@@ Property / cites work: Matrices and matroids for systems analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Q4000391
@@ Property / cites work: Q4000391 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3330974
@@ Property / cites work: Q3330974 / rank @@
+Normal rank
@@ Property / cites work @@
+A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+On covering intersecting set-systems by digraphs
@@ Property / cites work: On covering intersecting set-systems by digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A generalized-polymatroid approach to disjoint common independent sets in two matroids
+Normal rank