A Faster Algorithm for Max Cut in Dense Graphs

10/09/2021
by   Arijit Ghosh, et al.
0

We design an algorithm for approximating the size of Max Cut in dense graphs. Given a proximity parameter ε∈ (0,1), our algorithm approximates the size of Max Cut of a graph G with n vertices, within an additive error of ε n^2, with sample complexity 𝒪(1/ε^3log^2 1/εloglog1/ε) and query complexity of 𝒪(1/ε^4log^3 1/εloglog1/ε). Since Goldreich, Goldwasser and Ron (JACM 98) gave the first algorithm with sample complexity 𝒪(1/ε^5log1/ε) and query complexity of 𝒪(1/ε^7log^2 1/ε), there have been several efforts employing techniques from diverse areas with a focus on improving the sample and query complexities. Our work makes the first improvement in the sample complexity as well as query complexity after more than a decade from the previous best results of Alon, Vega, Kannan and Karpinski (JCSS 03) and of Mathieu and Schudy (SODA 08) respectively, both with sample complexity 𝒪(1/ε^4log1/ε). We also want to note that the best time complexity of this problem was by Alon, Vega, Karpinski and Kannan (JCSS 03). By combining their result with an approximation technique by Arora, Karger and Karpinski (STOC 95), they obtained an algorithm with time complexity of 2^𝒪(1/ε^2log1/ε). In this work, we have improved this further to 2^𝒪(1/εlog1/ε ).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/18/2022

Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm

In this note, we describe a α_GW + Ω̃(1/d^2)-factor approximation algori...
research
11/08/2022

On the cut-query complexity of approximating max-cut

We consider the problem of query-efficient global max-cut on a weighted ...
research
08/10/2021

Optimal learning of quantum Hamiltonians from high-temperature Gibbs states

We study the problem of learning a Hamiltonian H to precision ε, supposi...
research
10/01/2019

Approximating the Percolation Centrality through Sampling and Pseudo-dimension

In this work we investigate the problem of percolation centrality, a gen...
research
01/15/2019

Optimistic optimization of a Brownian

We address the problem of optimizing a Brownian motion. We consider a (r...
research
07/16/2018

Improving the smoothed complexity of FLIP for max cut problems

Finding locally optimal solutions for max-cut and max-k-cut are well-kno...
research
10/05/2018

Sample Complexity of Sinkhorn divergences

Optimal transport (OT) and maximum mean discrepancies (MMD) are now rout...

Please sign up or login with your details

Forgot password? Click here to reset