Faster matroid partition algorithms
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5764856 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 1953186 (Why is no real title available?)
- scientific article; zbMATH DE number 3301261 (Why is no real title available?)
- scientific article; zbMATH DE number 3313442 (Why is no real title available?)
- A Fast Approximation for Maximum Weight Matroid Intersection
- A faster cutting plane method and its implications for combinatorial and convex optimization
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Breaking the quadratic barrier for matroid intersection
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Combinatorial optimization. Theory and applications.
- Exact and approximation algorithms for weighted matroid intersection
- Fast algorithms via dynamic-oracle matroids
- Faster exact and approximation algorithms for packing and covering matroids via push-relabel
- Faster matroid intersection
- Faster matroid partition algorithms
- Improved Bounds for Matroid Partition and Intersection Algorithms
- Matching Theory for Combinatorial Geometries
- Matroid Intersection
- Matroid intersection algorithms
- Monotone Bipartite Graph Properties are Evasive
- Optimal matroid partitioning problems
- Simple push-relabel algorithms for matroids and submodular flows
- Some Abstract Pivot Algorithms
- Subquadratic weighted matroid intersection under rank oracles
This page was built for publication: Faster matroid partition algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6955687)
