Sorrachai Yingchareonthawornchai
where else to find them
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver | Optimization and Algorithm Design 2023 | 2023-11-27 |
Presents a 1+ε fractional LP solver for kECSS that runs in near-linear time Õ(m/ε²) and converts to a (2+ε)-approximation for integral k-edge-connected… | ||
| Vertex Connectivity in Poly-logarithmic Max-flows | 9th Annual Simons Institute Industry Day | 2023-11-02 |
Proves vertex connectivity (global and s–t) using only poly-logarithmic max-flows instead of the previous ~n max-flow runs, by generating many sublinear-size… | ||
| nothing matches | ||