Pages that link to "Item:Q466363"
From MaRDI portal
The following pages link to Reoptimization of max \(k\)-cover: approximation ratio threshold (Q466363):
Displaying 7 items.
- Reoptimization of constraint satisfaction problems with approximation resistant predicates (Q380664) (← links)
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- Sensitivity analysis of the knapsack problem: a negative result (Q465932) (← links)
- On the complexity of calculating sensitivity parameters in Boolean programming problems (Q904419) (← links)
- Reoptimization of set covering problems (Q2247803) (← links)
- Approximation to the reoptimization optimal sublinear algorithms of bounded-degree problems of a general feasibility (Q2850154) (← links)
- Thresholded Covering Algorithms for Robust and Max-min Optimization (Q3587385) (← links)