[algogeeks] Re: Minimum sum of matrix elements with unique row and column

Great work guys! Much love, Musatov On Mar 19, 7:07 am, Miroslav Balaz wrote: > Yes this is classicalproblem, > it can be reduced to Min-cost max-flow. But there are other algorithms. you > can find answer > herehttp://www.topcoder.com/tc?module=Static&d1=tutorials&d2=hungarianAlg... > > http:/

[algogeeks] Re: which NP-complete problem can reduce to this problem?

PROCESSORS P(NP, NP) RANGE X(N), Y(N) DISTRIBUTE X ONTO P(BLOCK, *) DISTRIBUTE Y ONTO P(*, BLOCK) SHADOW (1) X, Y REAL A X, Y ON (P) ! Initialize the array... OVERALL(I = X, J = Y) A [I, J] = ... ENDOVERALL DO ITER = 1, NITER DO ICOLOUR = 0, 1 CALL DA_WRITE_HALO(A, (/CYCL, CYCL/), (/1, 1/))

[algogeeks] [P=NP]Algorithm

PROCESSORS P(NP, NP) RANGE X(N), Y(N) DISTRIBUTE X ONTO P(BLOCK, *) DISTRIBUTE Y ONTO P(*, BLOCK) SHADOW (1) X, Y REAL A X, Y ON (P) ! Initialize the array... OVERALL(I = X, J = Y) A [I, J] = ... ENDOVERALL DO ITER = 1, NITER DO ICOLOUR = 0, 1 CALL DA_WRITE_HALO(A, (/CYCL, CYCL/), (/1, 1/))