Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs

DOI10.1007/978-3-030-39479-0_15OpenAlexW3001205721MaRDI QIDQ5918899

Fu-Hong Liu, Prudence W. H. Wong, Hsiang-Hsuan Liu

Publication date: 24 August 2020

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-39479-0_15

zbMATH Keywords

restricted assignmentoptimal online algorithmsmart grid scheduling

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Competitive algorithms for demand response management in a smart grid ⋮ Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs

This page was built for publication: Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs