1 paper
Abbas Bazzi, Ashkan Norouzi-Fard
We show a close connection between structural hardness for k-partite graphs and tight inapproximability results for scheduling problems with precedence constraints. Assuming a na…