The following pages link to Matroid intersection algorithms (Q4077061):
Displaying 43 items.
- The popular matching and condensation problems under matroid constraints (Q346527) (← links)
- Heuristically guided algorithm for k-parity matroid problems (Q754224) (← links)
- Structural theorems for submodular functions, polymatroids and polymatroid intersections (Q757383) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Clustered planarity testing revisited (Q895058) (← links)
- A detachment algorithm for inferring a graph from path frequency (Q1014796) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- Independence systems with continuous cardinality of bases (Q1149442) (← links)
- Discrete extremal problems (Q1152306) (← links)
- Crashing a maximum-weight complementary basis (Q1196719) (← links)
- Paroids: A canonical format for combinatorial optimization (Q1199464) (← links)
- Edge-disjoint spanning trees and depth-first search (Q1217713) (← links)
- Minimum cost source location problem with vertex-connectivity requirements in digraphs (Q1607133) (← links)
- Colorful linear programming, Nash equilibrium, and pivots (Q1707915) (← links)
- Fractional matroid matchings (Q1812954) (← links)
- Solving the linear matroid parity problem as a sequence of matroid intersection problems (Q1813836) (← links)
- The ellipsoid method and its implications (Q1835842) (← links)
- Finding all common bases in two matroids (Q1842654) (← links)
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
- Shortest bibranchings and valuated matroid intersection (Q1926655) (← links)
- Approximation by lexicographically maximal solutions in matching and matroid intersection problems (Q2118859) (← links)
- Packing of arborescences with matroid constraints via matroid intersection (Q2188242) (← links)
- The \(b\)-branching problem in digraphs (Q2192110) (← links)
- Alternating signed bipartite graphs and difference-1 colourings (Q2197215) (← links)
- On a weighted linear matroid intersection algorithm by deg-det computation (Q2227314) (← links)
- Exact and approximation algorithms for weighted matroid intersection (Q2316615) (← links)
- A weighted independent even factor algorithm (Q2429469) (← links)
- On a base exchange game on bispanning graphs (Q2448909) (← links)
- Even factors, jump systems, and discrete convexity (Q2519019) (← links)
- Analyzing Residual Random Greedy for monotone submodular maximization (Q2680237) (← links)
- On the cardinality constrained matroid polytope (Q3008918) (← links)
- Boolean sublattices connected with minimization problems on matroids (Q3922500) (← links)
- The Held—Karp algorithm and degree-constrained minimum 1-trees (Q4168404) (← links)
- (Q5005108) (← links)
- Input matrix construction and approximation using a graphic approach (Q5134304) (← links)
- (Q5136215) (← links)
- A Weighted Linear Matroid Parity Algorithm (Q5149751) (← links)
- (Q5197582) (← links)
- Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings (Q5234537) (← links)
- Optimal matroid bases with intersection constraints: valuated matroids, M-convex functions, and their applications (Q5918723) (← links)
- Persistency in combinatorial optimization problems on matroids (Q5936456) (← links)
- A deterministic parallel reduction from weighted matroid intersection search to decision (Q6130320) (← links)
- Matroid Intersection under Restricted Oracles (Q6161263) (← links)
