Makespan minimization on uniform machines is solved in time p_max^{O(d)} n^{O(1)}, settling an open question by Koutecký and Zink with an ETH-tight exponent.
Fas ter algorithms for bounded knapsack and bounded subset sum via fine-grained pro ximity results
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
ETH-Tight FPT Algorithm for Makespan Minimization on Uniform Machines
Makespan minimization on uniform machines is solved in time p_max^{O(d)} n^{O(1)}, settling an open question by Koutecký and Zink with an ETH-tight exponent.