Approximating weighted completion time via stronger negative correlation
Year of publication: |
2024
|
---|---|
Authors: | Baveja, Alok ; Qu, Xiaoran ; Srinivasan, Aravind |
Published in: |
Journal of scheduling : JOS. - Dordrecht [u.a.] : Springer Science + Business Media, ISSN 1099-1425, ZDB-ID 2012329-2. - Vol. 27.2024, 4, p. 319-328
|
Subject: | Approximation algorithms | Completion time | Dependent rounding | Scheduling | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm | Heuristik | Heuristics | Terminplanung | Time scheduling | Korrelation | Correlation | Zeit | Time |
-
Ma, Ran, (2014)
-
Chen, Yong, (2021)
-
Wan, Long, (2015)
- More ...
-
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Baveja, Alok, (2000)
-
Shivarajan, Sridevi, (2013)
-
Shivarajan, Sridevi, (2013)
- More ...