CORDIS Project
Funding breakdown and partner intelligence are Premium
Sign in and upgrade to Premium for EU contribution totals, consortium analytics, OpenAlex research context, and AI summaries. · 0 consortium intelligence fields visible of 1
Start free • Cancel anytime • 14-day refund guarantee
This project explores the complexity of NP-hard problems by analyzing specific parameters that contribute to their difficulty. It aims to develop efficient algorithms for various NP-hard problems, particularly focusing on path-related issues, by unifying different theoretical approaches in computer science.
Nowadays, numerous problems are known to be NP-hard, and hence unlikely to admit worst-case efficient algorithms.
Fortunately, the field of Parameterized Complexity (PC) shows that the nutshell of hardness often lies in particular properties (called parameters) of the instances.
Here, we answer the fundamental question:
What makes an NP-hard problem hard?
Specifically, how do different parameters of an NP-hard problem relate to its inherent difficulty?
Based on this knowledge, we design efficien…
BEN-GURION UNIVERSITY OF THE NEGEV
Partner organizations (coordinator is shown above), with normalized type and CORDIS activity type. Guests see up to 4 partners.
Similar projects, consortium collaboration history, frequent partners, and OpenAlex research context.
Guests see up to 5 EuroSciVoc fields.
Guests see up to 5 topics.
Guests see up to 5 keywords.
