Coordinatore | SCUOLA UNIVERSITARIA PROFESSIONALE DELLA SVIZZERA ITALIANA (SUPSI)
Spiacenti, non ci sono informazioni su questo coordinatore. Contattare Fabio per maggiori infomrazioni, grazie. |
Nazionalità Coordinatore | Switzerland [CH] |
Totale costo | 1˙122˙199 € |
EC contributo | 1˙122˙199 € |
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-2011-StG_20101014 |
Funding Scheme | ERC-SG |
Anno di inizio | 2012 |
Periodo (anno-mese-giorno) | 2012-01-01 - 2016-12-31 |
# | ||||
---|---|---|---|---|
1 |
UNIVERSITA DEGLI STUDI DI ROMA TOR VERGATA
Organization address
address: VIA ORAZIO RAIMONDO 18 contact info |
IT (ROMA) | beneficiary | 0.00 |
2 |
SCUOLA UNIVERSITARIA PROFESSIONALE DELLA SVIZZERA ITALIANA (SUPSI)
Organization address
address: STABILE LE GERRE contact info |
CH (MANNO) | hostInstitution | 1˙122˙199.20 |
3 |
SCUOLA UNIVERSITARIA PROFESSIONALE DELLA SVIZZERA ITALIANA (SUPSI)
Organization address
address: STABILE LE GERRE contact info |
CH (MANNO) | hostInstitution | 1˙122˙199.20 |
Esplora la "nuvola delle parole (Word Cloud) per avere un'idea di massima del progetto.
'Networks pervade every aspect of nowadays life. This is one of the reasons why their design, management, and analysis is one of the most active areas of theoretical and empirical research in Computer Science and Operations Research. The main goal of this project is to increase our theoretical understanding of networks, with a special focus on faster exact exponential-time algorithms and more accurate polynomial-time approximation algorithms for NP-hard network design problems. We will consider classic, challenging open problems in the literature, as well as new, exciting problems arising from the applications. These problems will be addressed with the most advanced algorithmic and analytical tools, including our recently developed techniques: iterative randomized rounding, core detouring, and randomized dissection.
A second, ambitious goal of this project is to stimulate the interaction and cross-fertilization between exact and approximation algorithms. This might open new research horizons.'