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 aims to develop advanced algorithms for solving NP-complete problems, such as the Traveling Salesman Problem and Knapsack Problem. By improving existing exponential time algorithms, it seeks to bridge the gap between current computational methods and more efficient solutions in theoretical computer science…
Assuming P does not equal NP, there are no polynomial time algorithms for any NP-complete problem.
This however still leaves a huge gap between anything super-polynomial and the exponential run times of trivial exhaustive search.
The study of exact (exponential time) algorithms that aims to breach this gap is as old as Theoretical Computer Science (TCS) itself:
Already in the 1960's, researchers found elementary (for modern standards) algorithms that greatly improve exponential the run times.
Bu…
UNIVERSITEIT UTRECHT
Partner organizations (coordinator is shown above), with normalized type and CORDIS activity type. Guests see up to 4 partners.
Netherlands, Eindhoven
Type: University / higher education
Activity type: Higher or Secondary Education Establishments
SME: No
Similar projects, consortium collaboration history, frequent partners, and OpenAlex research context.
Guests see up to 5 topics.
Guests see up to 5 keywords.
