Report
Teaser, summary, work performed and final results
Periodic Reporting for period 2 - PaPaAlg (Pareto-Optimal Parameterized Algorithms)
Teaser
In this project we revise the foundations of parameterized complexity, a modern multi-variate approach to algorithm design. The underlying question of every algorithmic paradigm is “what is the best algorithm?†When the running time of algorithms is measured in terms of...
Summary
In this project we revise the foundations of parameterized complexity, a modern multi-variate approach to algorithm design. The underlying question of every algorithmic paradigm is “what is the best algorithm?†When the running time of algorithms is measured in terms of only one variable, it is easy to compare which one is the fastest. However, when the running time depends on more than one variable, as is the case for parameterized complexity:
It is not clear what a “fastest possible algorithm†really means.
The previous formalizations of what a fastest possible parameterized algorithm means are one-dimensional, contrary to the core philosophy of parameterized complexity. These one-dimensional approaches to a multi-dimensional algorithmic paradigm unavoidably miss the most efficient algorithms, and ultimately fail to solve instances that we could have solved. We propose the first truly multi-dimensional framework for comparing the running times of parameterized algorithms. Our new definitions are based on the notion of Pareto-optimality from economics. The new approach encompasses all existing paradigms for comparing parameterized algorithms, opens up a whole new world of research directions in parameterized complexity, and reveals new fundamental questions about parameterized problems that were considered well understood. In this project we will develop powerful algorithmic and complexity theoretic tools to answer these research questions. The successful completion of this project will take parameterized complexity far beyond the state of the art, make parameterized algorithms more relevant for practical applications, and significantly advance adjacent sub-fields of theoretical computer science and mathematics.
Work performed
\"The main achievements of the project are:
- A much faster algorithm for the \"\"Disjoint Paths\"\" problem on planar graphs. This opens up an exciting possibility of substantially faster algorithms for minor testing, and in general making the Graph Minors project of Robertson and Seymour efficient in an algorithmic sense.
- A new framework called \"\"Lossy Kernelization\"\" to analyze the efficiency of pre-processing algorithms.\"
Final results
Both of the stated achievements go well beyond the state of the art. The project was concluded on December 31, 2018.
Website & more info
More info: https://cs.ucsb.edu/.