2 papers
cs.DS2020
Local Access to Sparse Connected Subgraphs Via Edge Sampling
Rogers Epstein
We contribute an approach to the problem of locally computing sparse connected subgraphs of dense graphs. In this setting, given an edge in a connected graph , an algor…
cs.DS2019
Property Testing of LP-Type Problems
Rogers Epstein, Sandeep Silwal
Given query access to a set of constraints , we wish to quickly check if some objective function subject to these constraints is at most a given value . We approach this…