Pages that link to "Item:Q3756518"
From MaRDI portal
The following pages link to Improved Bounds for Matroid Partition and Intersection Algorithms (Q3756518):
Displaying 29 items.
- Algorithms for the minimum weight of linear codes (Q259293) (← links)
- The popular matching and condensation problems under matroid constraints (Q346527) (← links)
- Computing pure Nash and strong equilibria in bottleneck congestion games (Q378094) (← links)
- Linking rigid bodies symmetrically (Q404454) (← links)
- On matching cover of graphs (Q463743) (← links)
- A flow model based on polylinking system (Q715085) (← links)
- Evolutionary algorithms and matroid optimization problems (Q848644) (← links)
- Clustered planarity testing revisited (Q895058) (← links)
- A detachment algorithm for inferring a graph from path frequency (Q1014796) (← links)
- A bound for the symmetric travelling salesman problem through matroid formulation (Q1388823) (← links)
- A logarithmic approximation for polymatroid congestion games (Q1709937) (← links)
- Finding all common bases in two matroids (Q1842654) (← links)
- Envy-free matchings with one-sided preferences and matroid constraints (Q2060385) (← links)
- Tree automata and pigeonhole classes of matroids. I (Q2149094) (← links)
- Submodular optimization problems and greedy strategies: a survey (Q2197586) (← 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 generalized-polymatroid approach to disjoint common independent sets in two matroids (Q2421866) (← links)
- Branch decomposition heuristics for linear matroids (Q2445840) (← links)
- Approximating clique-width and branch-width (Q2496203) (← links)
- (Q2999653) (← links)
- Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints (Q3449577) (← links)
- An Extension of the Brouwer-Zimmermann Minimum Weight Algorithm (Q3460472) (← links)
- Extension of the normal tree method (Q4244486) (← links)
- Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings (Q5234537) (← links)
- On the Kronecker Canonical Form of Singular Mixed Matrix Pencils (Q5278177) (← links)
- Popular Matchings with Ties and Matroid Constraints (Q5351863) (← links)
- A deterministic parallel reduction from weighted matroid intersection search to decision (Q6130320) (← links)
- Matroid Intersection under Restricted Oracles (Q6161263) (← links)
