Exact and approximation algorithms for weighted matroid intersection
From MaRDI portal
Publication:4575609
Recommendations
- Exact and approximation algorithms for weighted matroid intersection
- A Fast Approximation for Maximum Weight Matroid Intersection
- An algebraic algorithm for weighted linear matroid intersection
- Two algorithms for weighted matroid intersection
- Efficient theoretic and practical algorithms for linear matroid intersection problems
Cited in
(18)- scientific article; zbMATH DE number 1555984 (Why is no real title available?)
- The matroid intersection cover problem
- scientific article; zbMATH DE number 26304 (Why is no real title available?)
- An algorithm for weighted fractional matroid matching
- scientific article; zbMATH DE number 4068895 (Why is no real title available?)
- Matroid Intersection under Restricted Oracles
- A Fast Approximation for Maximum Weight Matroid Intersection
- Algorithms for the partial inverse matroid problem in which weights can only be increased
- An algebraic algorithm for weighted linear matroid intersection
- Preprocessing under uncertainty: matroid intersection
- On a weighted linear matroid intersection algorithm by deg-det computation
- Making bipartite graphs DM-irreducible
- The complexity of maximum matroid--greedoid intersection and weighted greedoid maximiza\-tion
- Random pseudo-polynomial algorithms for exact matroid problems
- On the Complexity of Recovering Incidence Matrices
- Packing of arborescences with matroid constraints via matroid intersection
- scientific article; zbMATH DE number 7378329 (Why is no real title available?)
- Two algorithms for weighted matroid intersection
This page was built for publication: Exact and approximation algorithms for weighted matroid intersection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575609)