Efficient Approximation of Maximum Cut in Weighted Undirected Graphs using Cut Queries

We provide tight bounds on the query complexity of achieving a c-approximation to the global max-cut in a weighted undirected graph, for various values of c. Our results demonstrate a phase transition at c = 1/2, with significantly different query complexities above and below this threshold.