6 citations · 33 across the 33 of their papers we have counts for
5 papers · 1 filter
Some remarks on hypergraph matching and the Füredi-Kahn-Seymour conjecture
Nikhil Bansal, David G. Harris
A classic conjecture of Füredi, Kahn and Seymour (1993) states that given any hypergraph with non-negative edge weights , there exists a matching such that $\sum_{e \in M…
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition
David G. Harris, Hsin-Hao Su, Hoa T. Vu
Given a graph with arboricity , we study the problem of decomposing the edges of into disjoint forests in the distributed LOCAL model. Barenboim and Elkin…
A new notion of commutativity for the algorithmic Lovász Local Lemma
David G. Harris, Fotis Iliopoulos, Vladimir Kolmogorov
The Lovász Local Lemma (LLL) is a powerful tool in probabilistic combinatorics which can be used to establish the existence of objects that satisfy certain properties. The breakthr…
Stochastic Optimization and Learning for Two-Stage Supplier Problems
Brian Brubach, Nathaniel Grammel, David G. Harris +3
The main focus of this paper is radius-based (supplier) clustering in the two-stage stochastic setting with recourse, where the inherent stochasticity of the model comes in the for…
Optimal Bounds for the -cut Problem
Anupam Gupta, David G. Harris, Euiwoong Lee +1
In the -cut problem, we want to find the lowest-weight set of edges whose deletion breaks a given (multi)graph into connected components. Algorithms of Karger \& Stein can s…