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 focuses on understanding how well NP-hard optimization problems can be approximated, particularly in relation to graph theory and constraint satisfaction. It aims to explore theoretical limits and develop new analytical tools using harmonic analysis to study Boolean functions.
The proposed project aims to create a center of excellence that aims at understanding the approximability of NP-hard optimization problems.
In particular, for central problems like vertex cover, coloring of graphs, and various constraint satisfaction problems we want to study upper and lower bounds on how well they can be approximated in polynomial time.
Many existing strong results are based on what is known as the Unique Games Conjecture (UGC) and a significant part of the project will be de…
KUNGLIGA TEKNISKA HOEGSKOLAN
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 topics.
