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
Posted Content
Minimum Weight Cycles and Triangles: Equivalences and Algorithms
TL;DR: The fundamental algorithmic problem of finding a cycle of minimum weight in a weighted graph is considered and efficient reductions imply the following surprising phenomenon: a minimum cycle with an arbitrary number of weighted edges can be ``encoded'' using only three edges within roughly the same weight interval.
Posted Content
Finding the Minimum-Weight k-Path
TL;DR: In this article, the problem of finding a minimum-weight copy of a k-node tree in a given weighted graph with integer edge weights was studied, and an exact solution with running time of O(tilde{O}(2^k poly(k) n^3 (log\log M + 1/varepsilon)) was given.
Book ChapterDOI
Approximate Distance Oracles with Improved Stretch for Sparse Graphs.
Liam Roditty,Roei Tov +1 more
TL;DR: In this article, Thorup and Zwick introduced the notion of approximate distance oracles, a data structure that produces for an n-vertices, m-edges weighted undirected graph, distance estimations in constant query time.
Posted Content
{-1, 0, 1}-APSP and (min, max)-Product Problems.
TL;DR: The $\{-1,0,1\}$-APSP problem can be solved in the same time needed for solving approximate APSP on graphs with positive weights, and a simple algorithm for target-(min,max)-product when the inputs are restricted to the family of inputs generated by the reduction.
Posted Content
Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners
TL;DR: In this paper, the authors gave an algorithm that in O(m)$ time computes an approximation of the girth in directed weighted graphs with high probability (w.h.p).