5 citations · 14 across the 12 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018★ 3 cited
Testing Graph Clusterability: Algorithms and Lower Bounds
Ashish Chiplunkar, Michael Kapralov, Sanjeev Khanna +2
We consider the problem of testing graph cluster structure: given access to a graph , can we quickly determine whether the graph can be partitioned into a few clusters wi…
cs.DS2018
Set Cover with Delay -- Clairvoyance is not Required
Yossi Azar, Ashish Chiplunkar, Shay Kutten +1
In most online problems with delay, clairvoyance (i.e. knowing the future delay of a request upon its arrival) is required for polylogarithmic competitiveness. In this paper, we sh…