Commit625006f

committed

fix tabulation

1 parent69b0702 commit625006fCopy full SHA for 625006f

File tree

-2

lines changed

-2

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -288,9 +288,9 @@ Here are a few examples related to the assignment problem, from very trivial to`
`288`	`288`	`-The Problem of Potentials. Given a matrix $A[1 \ldots n][1 \ldots m]$, it is required to find two arrays $u[1 \ldots n]$ and $v[1 \ldots m]$ such that, for any $i$ and $j$, $u[i] + v[j] \leq a[i][j]$ and the sum of elements of arrays $u$ and $v$ is maximum.<br>`
`289`	`289`	`Knowing the Hungarian algorithm, the solution to this problem will not be difficult: the Hungarian algorithm just finds such a potential $u, v$ that satisfies the condition of the problem. On the other hand, without knowledge of the Hungarian algorithm, it seems almost impossible to solve such a problem.`
`290`	`290`
`291`		`- !!! info "Remark"`
	`291`	`+!!! info "Remark"`
`292`	`292`
`293`		`-This task is also called the dual problem of the assignment problem: minimizing the total cost of the assignment is equivalent to maximizing the sum of the potentials.`
	`293`	`+This task is also called the dual problem of the assignment problem: minimizing the total cost of the assignment is equivalent to maximizing the sum of the potentials.`
`294`	`294`
`295`	`295`	`##Literature`
`296`	`296`

Comments

(0)