Pages that link to "Item:Q3936197"
From MaRDI portal
The following pages link to Complexity of Matroid Property Algorithms (Q3936197):
Displaying 38 items.
- Packing non-zero \(A\)-paths via matroid matching (Q317424) (← links)
- An algorithm for weighted fractional matroid matching (Q463292) (← links)
- On some combinatorial properties of algebraic matroids (Q581407) (← links)
- Corrigendum to our paper ''The ellipsoid method and its consequences in combinatorial optimization'' (Q761351) (← links)
- On matroid parity and matching polytopes (Q777400) (← links)
- Probabilistic single processor scheduling (Q912611) (← links)
- The parity problem of polymatroids without double circuits (Q987548) (← links)
- An augmenting path algorithm for linear matroid parity (Q1087880) (← links)
- An application of submodular flows (Q1119596) (← links)
- Recognizing graphic matroids (Q1172064) (← links)
- Structural properties of matroid matchings (Q1199466) (← links)
- The computational complexity of knot and matroid polynomials (Q1313843) (← links)
- On the graphic matroid parity problem (Q1400959) (← links)
- The linear delta-matroid parity problem (Q1400971) (← links)
- Optimization problems with color-induced budget constraints (Q1631646) (← links)
- Fractional matroid matchings (Q1812954) (← links)
- Solving the linear matroid parity problem as a sequence of matroid intersection problems (Q1813836) (← links)
- Independence and port oracles for matroids, with an application to computational learning theory (Q1924488) (← links)
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824) (← links)
- Complexity of packing common bases in matroids (Q2039228) (← links)
- Generalized matroid matching (Q2309561) (← links)
- A simple PTAS for weighted matroid matching on strongly base orderable matroids (Q2448875) (← links)
- Matroid matching with Dilworth truncation (Q2476281) (← links)
- Lattice path matroids: structural properties (Q2488838) (← links)
- Combinatorial auctions with decreasing marginal utilities (Q2506310) (← links)
- On the complexity of packing rainbow spanning trees (Q2685331) (← links)
- Algebraic Algorithms for Linear Matroid Parity Problems (Q2799476) (← links)
- A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids (Q2840687) (← links)
- Recent Developments in Discrete Convex Analysis (Q2971611) (← links)
- Greedoids and Linear Objective Functions (Q3323971) (← links)
- New applications of partial orders (Q3714902) (← links)
- Singular spaces of matrices and their application in combinatorics (Q4005434) (← links)
- On complexity of maximizatin of submodular functions<sup>*</sup> (Q4256098) (← links)
- Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
- (Q5136215) (← links)
- A Weighted Linear Matroid Parity Algorithm (Q5149751) (← links)
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective (Q6100609) (← links)
- Matroid Intersection under Restricted Oracles (Q6161263) (← links)
