42 citations · 110 across the 24 of their papers we have counts for
1 paper · 1 filter
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…