PARAPPROX
Parameterized Approximation
| Coordinatore | UNIVERSITETET I BERGEN
Spiacenti, non ci sono informazioni su questo coordinatore. Contattare Fabio per maggiori infomrazioni, grazie. |
| Nazionalità Coordinatore | Norway [NO] |
| Totale costo | 1˙690˙000 € |
| EC contributo | 1˙690˙000 € |
| Programma | FP7-IDEAS-ERC
Specific programme: "Ideas" implementing the Seventh Framework Programme of the European Community for research, technological development and demonstration activities (2007 to 2013) |
| Code Call | ERC-2012-StG_20111012 |
| Funding Scheme | ERC-SG |
| Anno di inizio | 2013 |
| Periodo (anno-mese-giorno) | 2013-01-01 - 2017-12-31 |
Partecipanti
| # | ||||
|---|---|---|---|---|
| 1 |
UNIVERSITETET I BERGEN
Organization address
address: Museplassen 1 contact info |
NO (BERGEN) | hostInstitution | 1˙690˙000.00 |
| 2 |
UNIVERSITETET I BERGEN
Organization address
address: Museplassen 1 contact info |
NO (BERGEN) | hostInstitution | 1˙690˙000.00 |
Mappa
Word cloud
Esplora la "nuvola delle parole (Word Cloud) per avere un'idea di massima del progetto.
Obiettivo del progetto (Objective)
'The main goal of this project is to lay the foundations of a ``non-polynomial time theory of approximation' -- the Parameterized Approximation for NP-hard optimization problems. A combination that will use the salient features of Approximation Algorithms and Parameterized Complexity. In the former, one relaxes the requirement of finding an optimum solution. In the latter, one relaxes the requirement of finishing in polynomial time by restricting the combinatorial explosion in the running time to a parameter that for reasonable inputs is much smaller than the input size. This project will explore the following fundamental question:
Approximation Algorithms Parameterized Complexity=?
New techniques will be developed that will simultaneously utilize the notions of relaxed time complexity and accuracy and thereby make problems for which both these approaches have failed independently, tractable. It is however conceivable that for some problems even this combined approach may not succeed. But in those situations we will glean valuable insight into the reasons for failure. In parallel to algorithmic studies, an intractability theory will be developed which will provide the theoretical framework to specify the extent to which this approach might work. Thus, on one hand the project will give rise to algorithms that will have impact beyond the boundaries of computer science and on the other hand it will lead to a complexity theory that will go beyond the established notions of intractability. Both these aspects of my project are groundbreaking -- the new theory will transcend our current ideas of efficient approximation and thereby raise the state of the art to a new level.'