Approximation Algorithms for Connected Maximum Cut and Related Problems

@inproceedings{Hajiaghayi2015ApproximationAF,
title={Approximation Algorithms for Connected Maximum Cut and Related Problems},
author={Mohammad Taghi Hajiaghayi and Guy Kortsarz and Robert MacDavid and Manish Purohit and Kanthi K. Sarpatwar},
booktitle={ESA},
year={2015}
}

An instance of the Connected Maximum Cut problem consists of an undirected graph G = (V,E) and the goal is to find a subset of vertices S ⊆ V that maximizes the number of edges in the cut δ(S) such that the induced graph G[S] is connected. We present the first non-trivial Ω( 1 logn ) approximation algorithm for the Connected Maximum Cut problem in general graphs using novel techniques. We then extend our algorithm to edge weighted case and obtain a poly-logarithmic approximation algorithm… CONTINUE READING