Thomas Rothvoß
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
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| From Gaussian Measure to Partial Colorings and Linear Size Sparsifiers | Concentration of Measure Phenomena | 2020-10-19 |
Proves a simple two-line polynomial algorithm: project a Gaussian onto K∩[-ε,ε]^n (convex program) and show with Gaussian concentration and a width inequality… | ||
| A (1+epsilon)-approximation for Makespan Scheduling with Precedence Constraints Using LP Hierarchies | Discrete Optimization via Continuous Relaxation | 2017-09-11 |
Claim: a 1+ε approximation for makespan on unit-length jobs with constant M, achieved by strengthening the time-indexed LP via the Sherali–Adams hierarchy… | ||
| Extended Formulations 1 | Bridging Continuous and Discrete Optimization Boot Camp 2017 | 2017-08-21 |
Quick tutorial that proves the core claims: extended formulations let some polytopes shrink from exponentially many inequalities to n×B network flow LP for… | ||
| Extended Formulations 2 | Bridging Continuous and Discrete Optimization Boot Camp 2017 | 2017-08-21 |
Shows a concrete lower bound for the correlation polytope by extracting a submatrix of its slack matrix with entries 1 for disjoint 0/1 vectors and 0 for pairs… | ||
| Extended Formulations 3 | Bridging Continuous and Discrete Optimization Boot Camp 2017 | 2017-08-21 |
Extension complexity equals non-negative rank of the slack matrix, and for the correlation polytope LP/SDP relaxations correspond to families or vector spaces… | ||
| Extended Formulations 4 | Bridging Continuous and Discrete Optimization Boot Camp 2017 | 2017-08-21 |
Shows how any bounded density F on {0,1}^n that tests indistinguishably against a family of functions D1 … Dm is approximated by a normalized exponential of a… | ||
| nothing matches | ||