Adaptive sparsification for matroid intersection
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3488914 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (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
- A simple \((1- \varepsilon)\)-approximation semi-streaming algorithm for maximum (weighted) matching
- A weighted matroid intersection algorithm
- AN EFFICIENT COST SCALING ALGORITHM FOR THE INDEPENDENT ASSIGNMENT PROBLEM
- 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)
- Connections in combinatorial optimization
- Exact and approximation algorithms for weighted matroid intersection
- Faster exact and approximation algorithms for packing and covering matroids via push-relabel
- Faster matroid intersection
- Graph sparsification by effective resistances
- Improved Bounds for Matroid Partition and Intersection Algorithms
- Matching Theory for Combinatorial Geometries
- Matroid intersection algorithms
- Nearly linear time approximations for mixed packing and covering problems without data structures or randomization
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- Quotient sparsification for submodular functions
- Random sampling and greedy sparsification for matroid optimization problems
- Randomized approximation schemes for cuts and flows in capacitated graphs
- Robust sparsification for matroid intersection with applications
- Transversals and matroid partition
- Two algorithms for weighted matroid intersection
This page was built for publication: Adaptive sparsification for matroid intersection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875069)
