typo error :- and each *row* *as cost On Sun, Sep 16, 2012 at 12:44 AM, atul anand <atul.87fri...@gmail.com>wrote:
> correct me if i am wrong , > it seems similar to Hungarian algorithm. > here each column can be considered as persons P(p0,p1,p2,..pn) and each as > cost of job say X(x0,x1,x2,x3,x4....xn). > Hungarian algorithm tells how to find minimal but here its maximal...so i > guess changes in the algo will give the outputl > > > On Sat, Sep 15, 2012 at 9:10 PM, Rahul Kumar Patle < > patlerahulku...@gmail.com> wrote: > >> A 2D array of order A[N][N] is given, considering entry A[i][i] as >> invalid you have to select one element from each row such that >> 1. Selected elements does not belong to same column. >> 2. Sum of selected element has maximal. >> >> >> -- >> Thanks and Regards: >> Rahul Kumar >> Patle<http://www.linkedin.com/profile/view?id=106245716&trk=tab_pro> >> M.Tech, School of Information Technology >> Indian Institute of Technology, Kharagpur-721302, >> India<http://www.iitkgp.ac.in/> >> Mobile No: +91-8798049298, +91-9424738542 >> Alternate Email: rahulkumarpa...@hotmail.com >> >> -- >> 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+unsubscr...@googlegroups.com. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- 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+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.