Pages that link to "Item:Q487021"
From MaRDI portal
The following pages link to A nearly linear-time PTAS for explicit fractional packing and covering linear programs (Q487021):
Displaying 8 items.
- The subset assignment problem for data placement in caches (Q724230) (← links)
- Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
- Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence (Q2414908) (← links)
- On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms (Q2944569) (← links)
- A Robust PTAS for Machine Covering and Packing (Q3586449) (← links)
- Fractional Set Cover in the Streaming Model. (Q5002615) (← links)
- Scalable and Jointly Differentially Private Packing (Q5091232) (← links)
- Algorithms – ESA 2004 (Q5464595) (← links)