22 citations · 50 across the 7 of their papers we have counts for
4 papers · 1 filter
On Small-Depth Tree Augmentations
Ojas Parekh, R. Ravi, Michael Zlatin
We study the Weighted Tree Augmentation Problem for general link costs. We show that the integrality gap of the ODD-LP relaxation for the (weighted) Tree Augmentation Problem for a…
Constant-Depth and Subcubic-Size Threshold Circuits for Matrix Multiplication
Ojas Parekh, Cynthia A. Phillips, Conrad D. James +1
Boolean circuits of McCulloch-Pitts threshold gates are a classic model of neural computation studied heavily in the late 20th century as a model of general computation. Recent adv…
Generalized Hypergraph Matching via Iterated Packing and Local Ratio
Ojas Parekh, David Pritchard
In -hypergraph matching, we are given a collection of sets of size at most , each with an associated weight, and we seek a maximum-weight subcollection whose sets are pairwis…
Iterative Packing for Demand and Hypergraph Matching
Ojas Parekh
Iterative rounding has enjoyed tremendous success in elegantly resolving open questions regarding the approximability of problems dominated by covering constraints. Although iterat…