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

Fu-Hong Liu, Hsiang Hsuan Liu, Prudence W. H. Wong. Greedy Is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs. In Evripidis Bampis, Nicole Megow, editors, Approximation and Online Algorithms - 17th International Workshop, WAOA 2019, Munich, Germany, September 12-13, 2019, Revised Selected Papers. Volume 11926 of Lecture Notes in Computer Science, pages 217-231, Springer, 2019. [doi]

@inproceedings{LiuLW19-15,
  title = {Greedy Is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs},
  author = {Fu-Hong Liu and Hsiang Hsuan Liu and Prudence W. H. Wong},
  year = {2019},
  doi = {10.1007/978-3-030-39479-0_15},
  url = {https://doi.org/10.1007/978-3-030-39479-0_15},
  researchr = {https://researchr.org/publication/LiuLW19-15},
  cites = {0},
  citedby = {0},
  pages = {217-231},
  booktitle = {Approximation and Online Algorithms - 17th International Workshop, WAOA 2019, Munich, Germany, September 12-13, 2019, Revised Selected Papers},
  editor = {Evripidis Bampis and Nicole Megow},
  volume = {11926},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-39479-0},
}