scientific article; zbMATH DE number 7378329

DOI10.4230/LIPIcs.MFCS.2018.12MaRDI QIDQ5005108

Naoyuki Kamiyama, Kenjiro Takazawa, Naonori Kakimura

Publication date: 4 August 2021

Full work available at URL: https://arxiv.org/abs/1802.02381

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

greedy algorithmpackingmatroid intersectionarborescencesparsity matroid

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

The \(b\)-branching problem in digraphs

Cites Work

• 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
• An application of simultaneous diophantine approximation in combinatorial optimization
• 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
• Integer round-up property for the chromatic number of some \(h\)-perfect graphs
• Excluded \(t\)-factors in bipartite graphs: a unified framework for nonbipartite matchings and restricted 2-matchings
• 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
• Exact and Approximation Algorithms for Weighted Matroid Intersection
• Blocking Optimal k-Arborescences
• Packing rooted directed cuts in a weighted directed graph
• Matroid-Based Packing of Arborescences
• Paths, Trees, and Flowers
• 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