OP-00423 Open Constant-gap NP-hardness of densest k-subgraph CO · AIM Open Applied Problems · densest k-subgraph · hardness of approximation
OP-00487 Open Polynomial-factor hardness of scheduling unit jobs on prescribed machines OC · AIM Open Applied Problems · hardness of approximation · precedence constraints · scheduling
OP-00733 Solution claimed The Unique Games Conjecture CO · AIM Open Applied Problems · constraint satisfaction · hardness of approximation · Unique Games Conjecture