Tight Bounds for Online Scheduling in the One-Fast-Many-Slow Machines Setting
arXiv:2602.22108v1 Announce Type: new Abstract: In the One-Fast-Many-Slow decision problem, introduced by Sheffield and Westover (ITCS '25), a scheduler, with access to one fast machine...