Extremal behavior of the Greedy algorithm for a triangle scheduling problem
| Year of publication: |
2024
|
|---|---|
| Authors: | Balogh, János ; Békési, József ; Büki, Nóra ; Dósa, György ; Tuza, Zsolt |
| Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 169.2024, Art.-No. 106718, p. 1-10
|
| Subject: | Mixed-criticality scheduling | Algorithm analysis | Triangle scheduling | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Theorie | Theory |
-
Exact distributional analysis of online algorithms with lookahead
Dunke, Fabian, (2021)
-
A low-rank approximation for MDPs via moment coupling
Zhang, Amy B. Z., (2024)
-
Evaluating the quality of online optimization algorithms by discrete event simulation
Dunke, Fabian, (2017)
- More ...
-
Semi-on-line bin packing : a short overview and a new lower bound
Balogh, János, (2013)
-
Békési, József, (2022)
-
Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
Dósa, György, (2019)
- More ...