When: Thursday, November 8th, 11.00AM
Where: DIAG, via Ariosto 25, Aula Magna, I floor
Speaker: Luca Becchetti, DIAG, "Sapienza" University of Rome
In this talk, I will present part of my recent research activity on Web search and data mining. The emphasis will be on the combinatorial optimization challenges that frequently arise in these areas and on the techniques to address them. As case studies, I will discuss two different application scenarios that entail the design of efficient techniques to solve variants and generalizations of the well-known set cover problem. I will highlight the main challenges, design issues and outline the main results we achieved.