New Approaches to Network Design

Decanato - Facoltà di scienze informatiche

Data d'inizio: 15 Ottobre 2012

Data di fine: 16 Ottobre 2012

The Faculty of Informatics is pleased to announce a seminar given by Fabrizio Grandoni

SPEAKER: Fabrizio Grandoni, Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA)

DATE: Monday, October 15th, 2012
PLACE: USI Università della Svizzera italiana, room A23, Red building (Via G. Buffi 13)
TIME: 15.30

In this talk I will overview part of my results of the last few years in the area of approximation algorithms for network design problems. I will start with the classical Steiner tree problem: given an undirected weighted graph and a set of terminal nodes, find the cheapest tree which spans all the terminals. From there I will move to harder related problems, characterized by more complex objective functions, uncertainty of the traffic patter etc. The talk is supposed to be understandable also for non-experts: I will mostly focus on algorithmic ideas and on the main analytical tools. 

Fabrizio Grandoni got a PhD in Computer Science at the University of Rome Tor Vergata in 2004. He had PostDoc positions at the MPII of Saarbrucken (2004), at the Sapienza University of Rome (2004-2007), and at the Technical University of Berlin (2007). He also visited the University of Bergen (2006) and EPFL (2008,2009). He was an Assistant Professor at the University of Rome Tor Vergata between 2007 and 2011.

He is an Assistant Professor at IDSIA since December 2011.

Fabrizio Grandoni served as a PC member of some of the main conferences in algorithms, including the ACM-SIAM Symposium on Discrete Algorithms (SODA), the International Colloquium on Automata, Languages and Programming (ICALP) and the European Symposium on Algorithms (ESA). In 2010 he received the best paper award at the ACM Symposium on Theory of Computing. In 2011 he was awarded an ERC Starting Grant. He published 67 papers, which received over 1200 citations. His work focuses on the theory of algorithms, in particular on approximation and exact/parameterized algorithms.

HOST: Prof. Evanthia Papadopoulou