Claims an O(n log n) (4/3)OPT + p_max algorithm for PTS that resolves a prior open question, plus faster and more general approximations for MCS.
Wolf, and Philip S
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Improved Approximation Algorithms for Parallel Task Scheduling and Multiple Cluster Scheduling
Claims an O(n log n) (4/3)OPT + p_max algorithm for PTS that resolves a prior open question, plus faster and more general approximations for MCS.