Matroid intersection algorithms
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3365295 (Why is no real title available?)
- A matroid generalization of a theorem of Mendelsohn and Dulmage
- Matroids and the greedy algorithm
- Minimum partition of a matroid into independent subsets
- On Matroid Theorems of Edmonds and Rado
- Transversals and matroid partition
Cited in
(54)- A deterministic parallel reduction from weighted matroid intersection search to decision
- Structural theorems for submodular functions, polymatroids and polymatroid intersections
- Crashing a maximum-weight complementary basis
- On a base exchange game on bispanning graphs
- Contractors' minimum spanning tree
- Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond
- Finding spanning trees with perfect matchings
- Minimum cost source location problem with vertex-connectivity requirements in digraphs
- Boolean sublattices connected with minimization problems on matroids
- Weighted linear matroid parity
- Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications
- A detachment algorithm for inferring a graph from path frequency
- The \(b\)-branching problem in digraphs
- Matroid Intersection under Restricted Oracles
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
- Edge-disjoint spanning trees and depth-first search
- Input matrix construction and approximation using a graphic approach
- Fractional matroid matchings
- A weighted linear matroid parity algorithm
- Online combinatorial assignment in independence systems
- Independence systems with continuous cardinality of bases
- Discrete extremal problems
- Online combinatorial assignment in independence systems
- Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings
- Approximation by lexicographically maximal solutions in matching and matroid intersection problems
- Generalized polymatroids and submodular flows
- Finding all common bases in two matroids
- Breaking O(nr) for matroid intersection
- Even factors, jump systems, and discrete convexity
- Heuristically guided algorithm for k-parity matroid problems
- Shortest bibranchings and valuated matroid intersection
- A weighted independent even factor algorithm
- Clustered planarity testing revisited
- Alternating signed bipartite graphs and difference-1 colourings
- On a weighted linear matroid intersection algorithm by deg-det computation
- Persistency in combinatorial optimization problems on matroids
- Quantum and classical query complexities for determining connectedness of matroids
- The popular matching and condensation problems under matroid constraints
- Adaptive sparsification for matroid intersection
- Lower bounds for matroid optimization problems with a linear constraint
- Simplicial generation of Chow rings of matroids
- On the cardinality constrained matroid polytope
- Solving the linear matroid parity problem as a sequence of matroid intersection problems
- Fast algorithms via dynamic-oracle matroids
- Paroids: A canonical format for combinatorial optimization
- Analyzing Residual Random Greedy for monotone submodular maximization
- Colorful linear programming, Nash equilibrium, and pivots
- Recent trends in combinatorial optimization
- Packing of arborescences with matroid constraints via matroid intersection
- scientific article; zbMATH DE number 7378329 (Why is no real title available?)
- Faster matroid partition algorithms
- Exact and approximation algorithms for weighted matroid intersection
- The Held—Karp algorithm and degree-constrained minimum 1-trees
- The ellipsoid method and its implications
This page was built for publication: Matroid intersection algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4077061)
