Showing 2026Show all
3 papers · 1 filter
cs.DS2026
Stochastic Minimum Spanning Tree Identification with Binary Weights
Haya Diwan, Lisa Hellerstein, Sanjeev Khanna +1
We introduce the Stochastic MST Identification Problem, with binary weights. In this problem, we need to identify a minimum spanning tree (MST) of a graph, each of whose edge weigh…
cs.DS2026
On Extensions of the Unanimous Vote Problem
Evan J. R. Brody, Haya Diwan, Lisa Hellerstein +1
The Unanimous Vote problem is to determine a fixed order in which to flip each of biased coins, where each coin can be flipped only once, such that the expected number of flips…
cs.DS2026
Approximating Matroid Basis Testing for Partition Matroids using Budget-In-Expectation
Lisa Hellerstein, Benedikt M. Plank, Kevin Schewior
We consider the following Stochastic Boolean Function Evaluation problem, which is closely related to several problems from the literature. A matroid (in compact repr…