Partial optimal labeling search for a NP-hard subclass of (max,+) problems

Ivan Kovtun

Journal Article

Partial optimal labeling search for a NP-hard subclass of (max,+) problems

Kovtun I

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2781 402-409

DOI: 10.1007/978-3-540-45243-0_52

28Citations

13Readers

Get full text

Abstract

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. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Kovtun, I. (2003). Partial optimal labeling search for a NP-hard subclass of (max,+) problems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2781, 402–409. https://doi.org/10.1007/978-3-540-45243-0_52

Partial optimal labeling search for a NP-hard subclass of (max,+) problems

Abstract

Cite

Register to see more suggestions