Interval scheduling with K machines

Правка en1, от iLoveIOI, 2020-05-15 12:30:08

How do I solve the interval scheduling problem but instead with k machines, meaning I can put the intervals in K different sets such that in each of the sets none of the intervals overlap and I want the maximum total interval, in O(nlogn) time or less.

Thanks!

Теги maybegreedy

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский iLoveIOI 2020-05-15 12:30:08 298 Initial revision (published)