Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs



Liu, Fu-Hon, Liu, Hsiang-Hsuan and Wong, PW ORCID: 0000-0001-7935-7245
(2020) Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs. In: Proceedings of the Workshop on Approximation and Online Algorithms (WAOA 2019).

[img] Text
waoa2019_final.pdf - Accepted Version

Download (334kB) | Preview
Item Type: Conference or Workshop Item (Unspecified)
Depositing User: Symplectic Admin
Date Deposited: 10 Feb 2020 10:42
Last Modified: 25 Feb 2020 09:19
URI: http://livrepository.liverpool.ac.uk/id/eprint/3074340