Pages that link to "Item:Q2850154"
From MaRDI portal
The following pages link to Approximation to the reoptimization optimal sublinear algorithms of bounded-degree problems of a general feasibility (Q2850154):
Displaying 4 items.
- Reoptimization of constraint satisfaction problems with approximation resistant predicates (Q380664) (← links)
- On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems (Q464901) (← links)
- The complexity of approximation reoptimization algorithms for discrete optimization (Q1797554) (← links)
- (Q3743106) (← links)