Pages that link to "Item:Q4575609"
From MaRDI portal
The following pages link to Exact and Approximation Algorithms for Weighted Matroid Intersection (Q4575609):
Displaying 16 items.
- Algorithms for the partial inverse matroid problem in which weights can only be increased (Q312484) (← links)
- An algorithm for weighted fractional matroid matching (Q463292) (← links)
- Efficient theoretic and practical algorithms for linear matroid intersection problems (Q1816747) (← links)
- A dual approximation approach to weighted matroid intersection (Q1919181) (← links)
- Packing of arborescences with matroid constraints via matroid intersection (Q2188242) (← links)
- On a weighted linear matroid intersection algorithm by deg-det computation (Q2227314) (← links)
- Exact and approximation algorithms for weighted matroid intersection (Q2316615) (← links)
- The complexity of maximum matroid--greedoid intersection and weighted greedoid maximiza\-tion (Q2489961) (← links)
- (Q3801569) (← links)
- (Q3984504) (← links)
- Random pseudo-polynomial algorithms for exact matroid problems (Q3990608) (← links)
- A Fast Approximation for Maximum Weight Matroid Intersection (Q4575610) (← links)
- Making Bipartite Graphs DM-Irreducible (Q4604647) (← links)
- (Q5005108) (← links)
- On the Complexity of Recovering Incidence Matrices (Q5874520) (← links)
- Matroid Intersection under Restricted Oracles (Q6161263) (← links)