85 citations · 294 across the 35 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2025
Optimal Online Bipartite Matching in Degree-2 Graphs
Amey Bhangale, Arghya Chakraborty, Prahladh Harsha
Online bipartite matching is a classical problem in online algorithms and we know that both the deterministic fractional and randomized integral online matchings achieve the same c…
cs.DS2015
Embedding approximately low-dimensional metrics into
Amit Deshpande, Prahladh Harsha, Rakesh Venkat
Goemans showed that any points in -dimensions satisfying triangle inequalities can be embedded into , with worst-case distortion at mo…
cs.DS2012★ 85 cited
Complexity of Inference in Graphical Models
Venkat Chandrasekaran, Nathan Srebro, Prahladh Harsha
It is well-known that inference in graphical models is hard in the worst case, but tractable for models with bounded treewidth. We ask whether treewidth is the only structural crit…