Multiplicative auction algorithm for approximate maximum weight bipartite matching
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- scientific article; zbMATH DE number 7829328 (Why is no real title available?)
- A framework for dynamic matching in weighted graphs
- A nearly linear-time PTAS for explicit fractional packing and covering linear programs
- A new algorithm for the assignment problem
- Algorithms for the Assignment and Transportation Problems
- An auction algorithm for bipartite matching in streaming and massively parallel computation models
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Deterministic decremental reachability, SCC, and shortest paths via directed expanders and congestion balancing
- Fully dynamic (1+ e)-approximate matchings
- Linear-time approximation for maximum weight matching
- Nearly linear time approximations for mixed packing and covering problems without data structures or randomization
- Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and =(1/)-convergence
- Online bipartite matching in offline time
- Randomized MWU for positive LPs
- Unified acceleration method for packing and covering problems via diameter reduction
- Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture
This page was built for publication: Multiplicative auction algorithm for approximate maximum weight bipartite matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7019049)
