Interval Scheduling: Select maximum non-overlapping intervals. Greedy O(n log n) -- in P. Weighted Interval Scheduling: Select non-overlapping intervals maximizing total weight. DP O(n log n) -- still ...
description [AAAI 2026][Online interval scheduling] For the irrevocable online interval scheduling problem, this paper proposes the SemiTrust-and-Switch framework and the SmoothMerge randomized ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results