Apr 24, 2020 · We present the first non-trivial approximation algorithm for the Connected Maximum Cut problem in general graphs using novel techniques.

Jul 2, 2015 · We present the first non-trivial \Omega(1/log n) approximation algorithm for the connected maximum cut problem in general graphs using novel techniques.

Nov 20, 2020 · Often, for basic connectivity problems on graphs, one can obtain simple O(log n) approximation algorithms using a probabilistic embedding into ...

Jan 20, 2020 · On the positive side, we obtain a polynomial time approximation scheme for the Connected Maximum Cut problem on planar graphs and more ...

Apr 24, 2020 · We present the first non-trivial Ω([Formula presented]) approximation algorithm for the Connected Maximum Cut problem in general graphs using ...

Nov 12, 2015 · We present the first non-trivial approximation algorithm for the connected maximum cut problem in general graphs using novel techniques. We then ...

The basic idea is to group the edges into logarithmic number of weight classes and show that the problem on each weight class boils down to the special case ...

This work presents the first non-trivial \(\Omega(\frac{1}{\log n})\) approximation algorithm for the connected maximum cut problem in general graphs using ...

Jul 26, 2018 · Here's a paper about a closely related problem: Approximation Algorithms for Connected Maximum Cut and Related Problems, by Hajiaghayi et al. – ...

We present the first non-trivial Ω(1log⁡n) approximation algorithm for the Connected Maximum Cut problem in general graphs using novel techniques. We then ...