Randomized MWU for positive LPs
From MaRDI portal
Recommendations
- A combinatorial bound for linear programming and related problems
- Approximating the solution to mixed packing and covering LPs in parallel \(\widetilde O(\varepsilon^{-3})\) time
- A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
- A subexponential bound for linear programming
- A randomized polynomial-time simplex algorithm for linear programming
Cited in
(8)- Multiplicative auction algorithm for approximate maximum weight bipartite matching
- A multiplicative weights update algorithm for packing and covering semi-infinite linear programs
- A multiplicative weights update algorithm for MINLP
- Approximating the solution to mixed packing and covering LPs in parallel \(\widetilde O(\varepsilon^{-3})\) time
- Fast and Deterministic Approximations for k-Cut.
- Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice
- A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs
- Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice
This page was built for publication: Randomized MWU for positive LPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607903)