Fabrizio Grandoni
where else to find them
no profile links on file
what they talk about
their talks carry no tags yet
where they keep going back
no series more than once — all 3 in the filters
on a stage with
- Claire Mathieuonce
- Hang Zhouonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Unsplittable Euclidean Capacitated Vehicle Routing: A 2+\epsilon)(2+ϵ)-Approximation Algorithm | ITCS 2023 | 2023-01-10 |
Proves a 2+ε approximation for unsplittable Euclidean CVRP with arbitrary demands by clustering small terminals in each cell into ε-sized groups, moving… | ||
| Surviving in Directed Graphs: A Quasi-polynomial-time Polylogarithmic Approximation... | Discrete Optimization via Continuous Relaxation | 2017-09-11 |
Claim: a quasi-polynomial-time algorithm achieves a polylogarithmic approximation for directed connectivity variants that require groups of terminals to reach… | ||
| Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter | Computational Complexity of Low-Polynomial Time Problems (Simons Institute workshop, 2015) | 2015-12-08 |
Fabrizio Grandoni, IDSIA, University of Lugano
Computational Complexity of Low-Polynomial Time Problems
https://simons.berkeley.edu/talks/fabrizo-grandoni-2015… | ||
| nothing matches | ||