[algogeeks] Re: MATROID problem !!!!!!!!!

any indea? --~--~-~--~~~---~--~~ 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 [EMAIL PROTECTED] For

[algogeeks] Re: euicvalence tester...!!!!

if u can do in O(n) test its gr8.. --~--~-~--~~~---~--~~ 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

[algogeeks] Re: euicvalence tester...!!!!

no. it wont be union find...anybody can think different approch for this problem? Rana wrote: It seems to be Union/Find problem. Google for union find algorithm --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups

[algogeeks] Re: need help help n help!!!

hi SPX2, can u explain your algorithm in a simple language? thank you --~--~-~--~~~---~--~~ 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

[algogeeks] Re: need help help n help!!!

anybody can answer in detain?? thanks --~--~-~--~~~---~--~~ 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

[algogeeks] Re: Interesting Problem : Polynomial-time Algorithm !!!

hi Dhyanesh! can u explain complete algo? sorry about silly question.. thanx much --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to

[algogeeks] Re: problem about MATROID...

anybody can think on this 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, send email

[algogeeks] Interesting Problem : Polynomial-time Algorithm !!!

hi guys new problem for uthink abt it and help me :) Suppose we want to replicate a file over a collection of n servers, labeled S1,S2,,Sn. To place a copy of the file at server Si results in a placement cost of Ci, for an integer Ci0. If a user requests the file at server Si, and no

[algogeeks] Re: significant inversion pairs

thank you for ur reply ajay --~--~-~--~~~---~--~~ 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] nonverticle lines in plane

hey duys...one more prob Given n nonverticle lines in the plane, labeled L1,,Ln with the ith line specified by the equation y = ai*x + bi. Assume that no three of the lines all meet at a single point. we say line Li is uppermost at a given x-coordinate x0 if its y-coordinate at x0 is

[algogeeks] need help help n help!!!

hi guys need help..please 1. each student in a group of n students is scheduled to work one shift, where each shift is a single congiguous interval of time. there can be multiple shifts going on at once. devise an effiecient algorithm to choose a smallest subset of these n students to form a

[algogeeks] may be greedy approach

hi all, sorry for reposting but i have many different problems so i thought will put all seperatly.. Q. each student in a group of n students is scheduled to work one shift, where each shift is a single congiguous interval of time. there can be multiple shifts going on at once. devise an