Sciweavers

DAGM
2003
Springer
13 years 9 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 th...
Ivan Kovtun