Pages that link to "Item:Q2719128"
From MaRDI portal
The following pages link to A decomposition theorem for maximum weight bipartite matchings (Q2719128):
Displaying 21 items.
- A simple reduction from maximum weight matching to maximum cardinality matching (Q456169) (← links)
- Quantum algorithms for matching problems (Q839634) (← links)
- Incremental assignment problem (Q865928) (← links)
- Parameterized matching with mismatches (Q924551) (← links)
- Maximum weight bipartite matching in matrix multiplication time (Q1035683) (← links)
- Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem (Q1337676) (← links)
- An improved upper bound on the expected regret of UCB-type policies for a matching-selection bandit problem (Q1785430) (← links)
- Exact and approximation algorithms for weighted matroid intersection (Q2316615) (← links)
- Weighted approximate parameterized string matching (Q2409763) (← links)
- Decomposition theorems for square-free 2-matchings in bipartite graphs (Q2410265) (← links)
- Reconfiguration of maximum-weight \(b\)-matchings in a graph (Q2420651) (← links)
- Optimal relay assignment and power allocation for cooperative communications (Q2434579) (← links)
- Reducing rank-maximal to maximum weight matching (Q2465632) (← links)
- Decomposition algorithms for solving the minimum weight maximal matching problem (Q2811314) (← links)
- Just-in-Time Scheduling with Equal-Size Jobs (Q2958671) (← links)
- Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
- An Optimum Lower Bound for the Weights of Maximum Weight Matching in Bipartite Graphs (Q5089613) (← links)
- A Filtering Technique for All Pairs Approximate Parameterized String Matching (Q5114858) (← links)
- (Q5743485) (← links)
- (Q5743486) (← links)
- On maximum bipartite matching with separation (Q6161448) (← links)
