We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
In this paper, we study the classification problem involving information spanning multiple private databases. The privacy challenges lie in the facts that data cannot be collected...