Content deleted Content added
→Weighted: I gave pseudocode to solve the weighted interval scheduling problem. |
→Weighted: syntaxhighlight error fix |
||
Line 40:
When the intervals have weights, the problem is equivalent to finding a maximum-weight [[Independent set (graph theory)|independent set]] in an [[interval graph]]. It can be solved in polynomial time.<ref name=":0">{{Cite journal|last=Bar-Noy|first=Amotz|last2=Bar-Yehuda|first2=Reuven|last3=Freund|first3=Ari|last4=(Seffi) Naor|first4=Joseph|last5=Schieber|first5=Baruch|author5-link=Baruch Schieber|date=2001-09-01|title=A unified approach to approximating resource allocation and scheduling|url=https://doi.org/10.1145/502102.502107|journal=Journal of the ACM|volume=48|issue=5|pages=1069–1090|doi=10.1145/502102.502107|issn=0004-5411}}</ref>
To find the maximum weight of a single interval schedule in Θ(n) time, perform the following pseudocode:
<syntaxhighlight line="1" lang="c"> // The vectors are already sorted from earliest to latest finish time.
int v[numOfVectors+1]; //list of interval vectors
Line 61 ⟶ 62:
schedule(j){
if(j==0){return;}
//add v[j] to schedule.
finalSchedule[index] = v[j];
| |||