The following pages link to Approximate parametric searching (Q685496):
Displaying 7 items.
- An efficient, strongly polynomial, \(\varepsilon\)-approximation parametric optimization scheme (Q290269) (← links)
- A generalized approximation framework for fractional network flow and packing problems (Q684147) (← links)
- Weakly adaptive comparison searching (Q1124340) (← links)
- \(\varepsilon\)-approximation minimization of convex functions in fixed dimension (Q1919184) (← links)
- On the complexity and approximability of budget-constrained minimum cost flows (Q2361495) (← links)
- Optimization of partial search (Q3374184) (← links)
- Optimal parametric search on graphs of bounded tree-width (Q5056174) (← links)