Sciweavers

Share
DAGM
2003
Springer

Partial Optimal Labeling Search for a NP-Hard Subclass of (max, +) Problems

9 years 6 months ago
Partial Optimal Labeling Search for a NP-Hard Subclass of (max, +) Problems
Optimal labeling problems are NP-hard in many practically important cases. Sufficient conditions for optimal label detection in every pixel are formulated. Knowing the values of the optimal labeling in some pixels, as a result of applying the proposed algorithm, allows to decrease the complexity of the original problem essentially.
Ivan Kovtun
Added 06 Jul 2010
Updated 06 Jul 2010
Type Conference
Year 2003
Where DAGM
Authors Ivan Kovtun
Comments (0)
books