Improved Bounds for Matroid Partition and Intersection Algorithms
From MaRDI portal
Recommendations
Cited in
(43)- A detachment algorithm for inferring a graph from path frequency
- Note on recognition of matroid systems
- Forests, frames, and games: Algorithms for matroid sums and applications
- A bound for the symmetric travelling salesman problem through matroid formulation
- A logarithmic approximation for polymatroid congestion games
- Fast approximation of matroid packing and covering
- Finding all common bases in two matroids
- Envy-free matchings with one-sided preferences and matroid constraints
- Tree automata and pigeonhole classes of matroids. I
- Submodular optimization problems and greedy strategies: a survey
- On a weighted linear matroid intersection algorithm by deg-det computation
- Exact and approximation algorithms for weighted matroid intersection
- A generalized-polymatroid approach to disjoint common independent sets in two matroids
- Branch decomposition heuristics for linear matroids
- Approximating clique-width and branch-width
- Algorithms for the minimum weight of linear codes
- scientific article; zbMATH DE number 5888307 (Why is no real title available?)
- Stable matchings with ties, master preference lists, and matroid constraints
- An extension of the Brouwer-Zimmermann minimum weight algorithm
- The popular matching and condensation problems under matroid constraints
- Computing pure Nash and strong equilibria in bottleneck congestion games
- Linking rigid bodies symmetrically
- Extension of the normal tree method
- On matching cover of graphs
- Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings
- On the Kronecker Canonical Form of Singular Mixed Matrix Pencils
- Popular matchings with ties and matroid constraints
- A deterministic parallel reduction from weighted matroid intersection search to decision
- Matroid Intersection under Restricted Oracles
- Fast algorithms via dynamic-oracle matroids
- Quantum and classical query complexities for determining connectedness of matroids
- Low recourse arborescence forests under uniformly random arcs
- Adaptive sparsification for matroid intersection
- Strongly stable matchings under matroid constraints
- Faster matroid partition algorithms
- Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond
- Structural preprocessing method for nonlinear differential-algebraic equations using linear symbolic matrices
- A flow model based on polylinking system
- Breaking O(nr) for matroid intersection
- Matroid and knapsack house allocation
- Deterministic (2/3-)-approximation of matroid intersection using nearly-linear independence-oracle queries
- Evolutionary algorithms and matroid optimization problems
- Clustered planarity testing revisited
This page was built for publication: Improved Bounds for Matroid Partition and Intersection Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3756518)
