Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex Cover
1997 ◽
Vol 21
(1-2)
◽
pp. S1087-S1092
◽
1997 ◽
Vol 48
(5)
◽
pp. 542-542
2012 ◽
Vol 132
(1)
◽
pp. 151-159
2020 ◽
Vol E103.A
(10)
◽
pp. 1193-1201