Euiwoong Lee
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 2 in the filters
on a stage with
- Madhur Tulsianionce
- Vijay Bhattiproluonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Separating the NP-Hardness of the Grothendieck problem from the Little-Grothendieck problem | ITCS 2022 | 2022-01-31 |
Proves NP-hardness of approximating the (bilinear) Grothendieck problem strictly beyond the PSD bound: shows no polytime algorithm achieves better than π/2 +… | ||
| Finding Best LP Relaxations for Various Cut Problems | Discrete Optimization via Continuous Relaxation | 2017-09-11 |
Proposes an estimation algorithm that, for fixed demand graph H, enumerates unambiguous supergraph F choices and returns the minimum standard flow‑LP value… | ||
| nothing matches | ||