Pages that link to "Item:Q2414908"
From MaRDI portal
The following pages link to Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence (Q2414908):
Displaying 4 items.
- A nearly linear-time PTAS for explicit fractional packing and covering linear programs (Q487021) (← links)
- Hidden Hamiltonian Cycle Recovery via Linear Programming (Q5130484) (← links)
- Algorithms – ESA 2004 (Q5464595) (← links)
- Improved algorithms for minimum-membership geometric set cover (Q6547827) (← links)