A greedy approximation algorithm for minimum-gap scheduling
Year of publication: |
June 2017
|
---|---|
Authors: | Chrobak, Marek ; Feige, Uriel ; Hajiaghayi, MohammadTaghi ; Khanna, Sanjeev ; Li, Fei ; Naor, Seffi |
Published in: |
Journal of scheduling. - New York, NY : Springer Science + Business Media LLC, ISSN 1094-6136, ZDB-ID 1492486-9. - Vol. 20.2017, 3, p. 279-292
|
Subject: | Scheduling | Approximation algorithms | Greedy algorithms | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Operations Research | Operations research |
-
Efficient approximation algorithms for scheduling moldable tasks
Wu, Xiaohu, (2023)
-
Györgyi, Péter, (2019)
-
Application of quantum approximate optimization algorithm to job shop scheduling problem
Kurowski, Krzysztof, (2023)
- More ...
-
News posting by strategic users in a social network
Gupte, Mangesh, (2009)
-
Scheduling to minimize gaps and power consumption
Demaine, Erik D., (2013)
-
A theory of loss-leaders : making money by pricing below cost
Balcan, Maria-Florina, (2007)
- More ...