On the cut-query complexity of approximating max-cut

11/08/2022
by   Orestis Plevrakis, et al.
0

We consider the problem of query-efficient global max-cut on a weighted undirected graph in the value oracle model examined by [RSW18]. This model arises as a natural special case of submodular function maximization: on query S ⊆ V, the oracle returns the total weight of the cut between S and V \ S. For most constants c ∈ (0,1], we nail down the query complexity of achieving a c-approximation, for both deterministic and randomized algorithms (up to logarithmic factors). Analogously to general submodular function maximization in the same model, we observe a phase transition at c = 1/2: we design a deterministic algorithm for global c-approximate max-cut in O(log n) queries for any c < 1/2, and show that any randomized algorithm requires Ω̃(n) queries to find a c-approximate max-cut for any c > 1/2. Additionally, we show that any deterministic algorithm requires Ω(n^2) queries to find an exact max-cut (enough to learn the entire graph), and develop a Õ(n)-query randomized c-approximation for any c < 1. Our approach provides two technical contributions that may be of independent interest. One is a query-efficient sparsifier for undirected weighted graphs (prior work of [RSW18] holds only for unweighted graphs). Another is an extension of the cut dimension to rule out approximation (prior work of [GPRW20] introducing the cut dimension only rules out exact solutions).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/08/2017

Computing exact minimum cuts without knowing the graph

We give query-efficient algorithms for the global min-cut and the s-t cu...
research
11/10/2020

On the cut dimension of a graph

Let G = (V,w) be a weighted undirected graph with m edges. The cut dimen...
research
10/09/2021

A Faster Algorithm for Max Cut in Dense Graphs

We design an algorithm for approximating the size of Max Cut in dense gr...
research
06/16/2023

Learning Spanning Forests Optimally using CUT Queries in Weighted Undirected Graphs

In this paper we describe a randomized algorithm which returns a maximal...
research
08/05/2020

A Note on a Recent Algorithm for Minimum Cut

Given an undirected edge-weighted graph G=(V,E) with m edges and n verti...
research
12/18/2020

Subcubic Algorithms for Gomory-Hu Tree in Unweighted Graphs

Every undirected graph G has a (weighted) cut-equivalent tree T, commonl...
research
05/03/2021

Fault Tolerant Max-Cut

In this work, we initiate the study of fault tolerant Max Cut, where giv...

Please sign up or login with your details

Forgot password? Click here to reset