63 citations · 124 across the 20 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020★ 2 cited
Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms
Sepehr Assadi, Ran Raz
We prove that any two-pass graph streaming algorithm for the - reachability problem in -vertex directed graphs requires near-quadratic space of bits. As a cor…
cs.DS2012★ 1 cited
Label Cover instances with large girth and the hardness of approximating basic k-spanner
Michael Dinitz, Guy Kortsarz, Ran Raz
We study the well-known Label Cover problem under the additional requirement that problem instances have large girth. We show that if the girth is some , the problem is roughly…