Skip to main content
Go to the home page of the European Commission (opens in new window)
English English
CORDIS - EU research results
CORDIS

Parameterized Complexity Through the Lens of Path Problems

Project description

Another way to look at the hardest of the hard problems

Some problems can’t be solved. They are the hard of the hardest. These are termed NP-hard and cannot admit worst-case efficient algorithms. The field of parameterised complexity (PC) reveals that the nutshell of hardness often lies in particular properties of the instances called parameters. At the heart of PC lies the study of path (or cycle) problems. However, fundamental questions concerning path problems remain unanswered, and the relations between the different techniques to solve path problems are unknown. The EU-funded PARAPATH project will build a unified, deep theory to analyse parameterised path problems. The project will answer the fundamental question ‘What makes an NP-hard problem hard?’ The answer will assist in the design of efficient algorithms for wide classes of instances of NP-hard problems.

Objective

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 efficient algorithms for wide-classes of instances of NP-hard problems.
At the heart of PC lies the study of path (or cycle) problems. The inception of PC was inspired by the Graph Minors Theory, where the resolution of DISJOINT PATHS is a cornerstone. Moreover, the study of k-PATH has led to a large number of major breakthroughs in PC over the past three decades. Still, (i) fundamental questions concerning path problems have remained unanswered, and (ii) close to nothing is known about the relations between the different techniques to solve path problems.
The overarching goal of this proposal is to build a unified, deep theory to analyze parameterized path problems.
As known techniques to solve path problems rely, individually, on Graph Minors Theory, Extremal Combinatorics, Matroid Theory, Exterior Algebra, and more, I will draw new deep connections between these fields (towards unification).
Based on the new theory, I believe that I will be able to answer decades-old questions in PC, which will revolutionize the power of this field. This includes the establishment of an Efficient Graph Minors Theory, an optimality program for color-coding-amenable problems, and a machinery to refute the existence of polynomial Turing kernels. Answers to these questions will substantially reshape the future of the design of parameterized algorithms, graph algorithms, and preprocessing procedures. Additionally, they will have high impact applications in practice.

Fields of science (EuroSciVoc)

CORDIS classifies projects with EuroSciVoc, a multilingual taxonomy of fields of science, through a semi-automatic process based on NLP techniques. See: The European Science Vocabulary.

You need to log in or register to use this function

Keywords

Project’s keywords as indicated by the project coordinator. Not to be confused with the EuroSciVoc taxonomy (Fields of science)

Programme(s)

Multi-annual funding programmes that define the EU’s priorities for research and innovation.

Topic(s)

Calls for proposals are divided into topics. A topic defines a specific subject or area for which applicants can submit proposals. The description of a topic comprises its specific scope and the expected impact of the funded project.

Funding Scheme

Funding scheme (or “Type of Action”) inside a programme with common features. It specifies: the scope of what is funded; the reimbursement rate; specific evaluation criteria to qualify for funding; and the use of simplified forms of costs like lump sums.

HORIZON-ERC - HORIZON ERC Grants

See all projects funded under this funding scheme

Call for proposal

Procedure for inviting applicants to submit project proposals, with the aim of receiving EU funding.

(opens in new window) ERC-2021-STG

See all projects funded under this call

Host institution

BEN-GURION UNIVERSITY OF THE NEGEV
Net EU contribution

Net EU financial contribution. The sum of money that the participant receives, deducted by the EU contribution to its linked third party. It considers the distribution of the EU financial contribution between direct beneficiaries of the project and other types of participants, like third-party participants.

€ 1 499 821,00
Total cost

The total costs incurred by this organisation to participate in the project, including direct and indirect costs. This amount is a subset of the overall project budget.

€ 1 499 821,00

Beneficiaries (1)

My booklet 0 0