[algogeeks] Re: may be greedy approach

This problem is actually NP-Complete and is same as set-cover problem. --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsu

[algogeeks] Re: may be greedy approach

How about dynamic programming solution to this problem? The nth entry may be chosen or may not be chosen. If it is chosen then the sub problem to be solved is that of all those entries whose start times are after the end time of the nth entry. C(N,S) = 1+C(N',S') where S' = S U {n} and N' = tho

[algogeeks] Re: may be greedy approach

its actually called backtracking --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to

[algogeeks] Re: may be greedy approach

For each student, form a bitstring of all the students whose shifts overlap this student's shift. Find the minimum number of such bitstrings needed such that their bitwise-or has all ones. You can then use a breadth-first search to determine the smallest subset. Try all combinations of one bits

[algogeeks] Re: may be greedy approach

anybody have suggestion for above problem? --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, sen