Complexity of Matroid Property Algorithms
From MaRDI portal
Cited in
(48)- An augmenting path algorithm for linear matroid parity
- An application of submodular flows
- Recognizing graphic matroids
- Structural properties of matroid matchings
- The computational complexity of knot and matroid polynomials
- On the graphic matroid parity problem
- The linear delta-matroid parity problem
- Optimization problems with color-induced budget constraints
- Fractional matroid matchings
- Solving the linear matroid parity problem as a sequence of matroid intersection problems
- Independence and port oracles for matroids, with an application to computational learning theory
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- Complexity of packing common bases in matroids
- Generalized matroid matching
- A simple PTAS for weighted matroid matching on strongly base orderable matroids
- Matroid matching with Dilworth truncation
- Lattice path matroids: structural properties
- Combinatorial auctions with decreasing marginal utilities
- On the complexity of packing rainbow spanning trees
- Algebraic algorithms for linear matroid parity problems
- A simple PTAS for weighted matroid matching on strongly base orderable matroids
- Recent developments in discrete convex analysis
- Packing non-zero \(A\)-paths via matroid matching
- Greedoids and Linear Objective Functions
- New applications of partial orders
- Singular spaces of matrices and their application in combinatorics
- On complexity of maximizatin of submodular functions*
- Submodular functions: learnability, structure, and optimization
- An algorithm for weighted fractional matroid matching
- Weighted linear matroid parity
- A weighted linear matroid parity algorithm
- On some combinatorial properties of algebraic matroids
- Optimal general factor problem and jump system intersection
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective
- Matroid Intersection under Restricted Oracles
- Representing matroids over the reals is \(\exists \mathbb{R}\)-complete
- Quantum and classical query complexities for determining connectedness of matroids
- Lower bounds for matroid optimization problems with a linear constraint
- Budgeted matroid maximization: a parameterized viewpoint
- Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond
- Analysis of the two-for-one swap heuristic for approximating the maximum independent set in a k-polymatroid
- Optimal general factor problem and jump system intersection
- Fixed-parameter tractability of maximum colored path and beyond
- Towards the proximity conjecture on group-labeled matroids
- Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
- On matroid parity and matching polytopes
- Probabilistic single processor scheduling
- The parity problem of polymatroids without double circuits
This page was built for publication: Complexity of Matroid Property Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3936197)
