59 citations · 104 across the 8 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2023
Smoothed Complexity of SWAP in Local Graph Partitioning
Xi Chen, Chenghao Guo, Emmanouil-Vasileios Vlatakis-Gkaragkounis +1
We give the first quasipolynomial upper bound for the smoothed complexity of the SWAP algorithm for local Graph Partitioning (also known as Bisection Width…
cs.DS2022
Linear Programs with Polynomial Coefficients and Applications to 1D Cellular Automata
Guy Bresler, Chenghao Guo, Yury Polyanskiy
Given a matrix and vector with polynomial entries in real variables we consider the following notion of feasibility: the pair is locally fe…
cs.DS2019★ 1 cited
Smoothed complexity of local Max-Cut and binary Max-CSP
Xi Chen, Chenghao Guo, Emmanouil-Vasileios Vlatakis-Gkaragkounis +2
We show that the smoothed complexity of the FLIP algorithm for local Max-Cut is at most , where is the number of nodes in the graph and is a…