The following pages link to (Q4792058):
Displaying 8 items.
- Differential approximation of MIN SAT, MAX SAT and related problems (Q877035) (← links)
- Approximate solution of a resource-constrained scheduling problem (Q1009198) (← links)
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- Local approximations for maximum partial subgraph problem. (Q1426723) (← links)
- Approximation of the double traveling salesman problem with multiple stacks (Q2034797) (← links)
- Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
- Polynomially bounded minimization problems which are hard to approximate (Q4630248) (← links)
- Hardness and Approximation Results for <i>L<sub>p</sub></i>-Ball Constrained Homogeneous Polynomial Optimization Problems (Q5247613) (← links)