22 citations · 58 across the 9 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.DS2016
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…
quant-ph2016
Benchmarking Adiabatic Quantum Optimization for Complex Network Analysis
Ojas Parekh, Jeremy Wendt, Luke Shulenburger +3
We lay the foundation for a benchmarking methodology for assessing current and future quantum computers. We pose and begin addressing fundamental questions about how to fairly comp…
cs.DS2016
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…