L
Liam Roditty
Researcher at Bar-Ilan University
Publications - 115
Citations - 3957
Liam Roditty is an academic researcher from Bar-Ilan University. The author has contributed to research in topics: Directed graph & Approximation algorithm. The author has an hindex of 34, co-authored 111 publications receiving 3555 citations. Previous affiliations of Liam Roditty include Weizmann Institute of Science & Tel Aviv University.
Papers
More filters
Proceedings ArticleDOI
Fast approximation algorithms for the diameter and radius of sparse graphs
TL;DR: This paper presents the first improvement over the diameter approximation algorithm of Aingworth et.
Book ChapterDOI
Deterministic constructions of approximate distance oracles and spanners
TL;DR: The first deterministic linear time algorithm for constructing optimal spanners of weighted graphs is obtained by derandomizing the O(km) expected time algorithm of Baswana and Sen for constructing (2k–1)-spanners of size O(kn) of weighted undirected graphs without incurring any asymptotic loss in the running time or in the size of the spanners produced.
Journal ArticleDOI
On Dynamic Shortest Paths Problems
Liam Roditty,Uri Zwick +1 more
TL;DR: Reductions that show that the incremental and decremental single-source shortest-paths problems, for weighted directed or undirected graphs, are, in a strong sense, at least as hard as the static all-pairs shortest- Paths problem.
Proceedings ArticleDOI
On nash equilibria for a network creation game
TL;DR: In this article, it was shown that for any positive integer n 0, there exists a graph built by n ≥ n0 players which contains cycles and forms a non-transient Nash equilibrium, for any α with 1.
Book ChapterDOI
On Dynamic Shortest Paths Problems
Liam Roditty,Uri Zwick +1 more
TL;DR: Reductions that show that the incremental and decremental single-source shortest-paths problems, for weighted directed or undirected graphs, are, in a strong sense, at least as hard as the static all-pairs shortest- Paths problem.