R. Ravi
where else to find them
no profile links on file
what they talk about
their talks carry no tags yet
where they keep going back
no series more than once — all 3 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Approximately Packing Dijoins Via Nowhere-Zero Flows | The Role of TCS in Modern Machine Learning | 2026-05-26 |
Proves a concrete packing bound: if the underlying undirected graph admits a nowhere-zero k-flow, then a digraph with minimum dicut size τ contains ⌊τ/k⌋… | ||
| LP Rounding for Poise | Discrete Optimization via Continuous Relaxation | 2017-09-11 |
Gives an LP rounding algorithm that produces a spanning (or Steiner) tree whose sum of diameter and maximum degree (poise) is within O(log n) of the LP… | ||
| Interpolating Between Stochastic and Worst-case Optimization | Optimization and Decision-Making Under Uncertainty (Simons Institute, September 2016) | 2016-09-19 |
Proposes a hybrid input model that interpolates between stochastic and adversarial arrivals via a lever epsilon that flips each request with probability… | ||
| nothing matches | ||