Unified acceleration method for packing and covering problems via diameter reduction
From MaRDI portal
Recommendations
- Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and =(1/)-convergence
- Nearly-linear time positive LP solver with faster convergence rate
- Approximating the solution to mixed packing and covering LPs in parallel \(\widetilde O(\varepsilon^{-3})\) time
- A nearly linear-time PTAS for explicit fractional packing and covering linear programs
- Faster and simpler approximation algorithms for mixed packing and covering problems
Cited in
(12)- A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs
- Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and =(1/)-convergence
- A multiplicative weights update algorithm for packing and covering semi-infinite linear programs
- Linear coupling: an ultimate unification of gradient and mirror descent
- Fractional set cover in the streaming model
- Towards more practical linear programming-based techniques for algorithmic mechanism design
- Multiplicative auction algorithm for approximate maximum weight bipartite matching
- Multiplicative auction algorithm for approximate maximum weight bipartite matching
- Global Riemannian acceleration in hyperbolic and spherical spaces
- Distributed load balancing: a new framework and improved guarantees
- A faster algorithm for constrained correlation clustering
- Decremental (1+)-approximate maximum eigenvector: dynamic power method
This page was built for publication: Unified acceleration method for packing and covering problems via diameter reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598189)
