The following pages link to (Q4470516):
Displaying 10 items.
- The simplified partial digest problem: approximation and a graph-theoretic model (Q621677) (← links)
- Approximate solution of NP optimization problems (Q672315) (← links)
- Local search, reducibility and approximability of NP-optimization problems (Q673464) (← links)
- Structural properties of bounded relations with an application to NP optimization problems (Q1589424) (← links)
- On weighted vs unweighted versions of combinatorial optimization problems (Q1854428) (← links)
- Bounded queries, approximations, and the Boolean hierarchy (Q1854449) (← links)
- Max NP-completeness made easy (Q1960655) (← links)
- Improved non-approximability results for minimum vertex cover with density constraints (Q1960657) (← links)
- Genetic local search and hardness of approximation for the server load balancing problem (Q2399467) (← links)
- Structure in approximation classes (Q6085751) (← links)
