We have r rooms in the Willard building and n activities that we may schedule in

Question

We have r rooms in the Willard building and n activities that we may schedule in these rooms, for i = 1, . . . . ,n activity has the start time s, and ending tune Our goal is to schedule as many activities as possible To schedule an activity ts to assign it with the room number S[t] If activity i is not scheduled. we set S(i] = 0 Schedule S[n] is correct if activities scheduled in the same room do not use that room at the same time. More formally, if 1 le j le n in then either S[i] S[j], these two activities are not scheduled n die san>e room, or S[i] = 0. these activities are not scheduled, or e,

Explanation / Answer

plz check these links... (use full) http://www.huffmancoding.com/my-family/my-uncle/huffman-algorithm http://xlinux.nist.gov/dads/HTML/greedyalgo.html http://wwwc3.lanl.gov/mega-math/gloss/compute/greedy.html http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/Greedy/greedyIntro.htm http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=greedyAlg

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.