Partial optimal labeling search for (max,+) problems.

                    Ivan Kovtun

                      Abstract.             

Optimal labeling problems are NP-hard in many practically important
cases. Therefore, a number of investigations are devoted to a
searching for approximative algorithms. An algorithm, that make a
desision about the optimal labeling in each pixel individually is
proposed. At that the special label "no label" is allowed.