OpenAlex
PricingAboutJobs
Log inGet started
Work

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

HTML

Year: 2003
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Pattern Recognition: 25th DAGM Symposium, Magdeburg, Germany, September 10-12, 2003. Proceedings
DOI: 10.1007/978-3-540-45243-0_52
Author: Ivan Kovtun
Institution: Technische Universität Dresden
Language: English

Topic: Digital Image Processing Techniques
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Keywords: max-algebra, NP-hard problems, label detection, computational complexity reduction, sufficient conditions, combinatorial optimization

Open Access status: closed
OpenAlex ID: W1496918921
FWCI: 0.477
Cites: 8
Cited by: 54
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security