Charles Carlson

activity

20162023

most citedEfficient algorithms for the Potts model on small-set expanders

9 citations · 13 across the 8 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

cs.DS2018

Lower bounds for Max-Cut in $H$ -free graphs via semidefinite programming

Charles Carlson, Alexandra Kolla, Ray Li +3

For a graph $G$ , let $f (G)$ denote the size of the maximum cut in $G$ . The problem of estimating $f (G)$ as a function of the number of vertices and edges of $G$ has a long history…

cs.DS2018

Improving the smoothed complexity of FLIP for max cut problems

Ali Bibak, Charles Carlson, Karthekeyan Chandrasekaran

Finding locally optimal solutions for max-cut and max- $k$ -cut are well-known PLS-complete problems. An instinctive approach to finding such a locally optimum solution is the FLIP m…

Lower bounds for Max-Cut in H-free graphs via semidefinite programming

Improving the smoothed complexity of FLIP for max cut problems

Lower bounds for Max-Cut in $H$ -free graphs via semidefinite programming