Risultati ricerca pubblicazioni

Computing the Shapley value in allocation problems: approximations and bounds, with an application to the Italian VQR research assessment program

pubblicato su: JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE - 2018
Lupia Francesco, Mendicelli Angelo, Ribichini Andrea, Scarcello Francesco, Schaerf Marco

Stochastic graph exploration

pubblicato su: 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) - 2019
Anagnostopoulos A., Cohen I. R., Leonardi S., Lacki J.

A mazing 2+ε approximation for unsplittable flow on a path

pubblicato su: ACM TRANSACTIONS ON ALGORITHMS - 2018
Anagnostopoulos Aris, Grandoni Fabrizio, Leonardi Stefano, Wiese Andreas

Approximation algorithms for replenishment problems with fixed turnover times

pubblicato su: LATIN 2018: Theoretical Informatics - 2018
Bosman Thomas, van Ee Martijn, Jiao Yang, Marchetti-Spaccamela Alberto, Ravi R., Stougie Leen

String factorisations with maximum or minimum dimension

pubblicato su: THEORETICAL COMPUTER SCIENCE - 2020
Monti A., Sinaimeri B.

Fair Coresets and Streaming Algorithms for Fair k-means

pubblicato su: Approximation and Online Algorithms - 2020
Schmidt M., Schwiegelshohn C., Sohler C.

© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma