Max-Cut Under Graph Constraints

An instance of the graph-constrained max-cut (GCMC) problem consists of (i) an undirected graph G and (ii) edge-weights on a complete undirected graph on the same vertex set. The objective is to find a subset of vertices satisfying some graph-based constraint in G that maximizes the total weight of edges in the cut. The types of graph constraints we can handle include independent set, vertex cover, dominating set and connectivity. Our main results are for the case when G is a graph with bounded treewidth, where we obtain a 0.5-approximation algorithm. Our algorithm uses an LP relaxation based on the Sherali-Adams hierarchy. It can handle any graph constraint for which there is a (certain type of) dynamic program that exactly optimizes linear objectives. Using known decomposition results, these imply essentially the same approximation ratio for GCMC under constraints such as independent set, dominating set and connectivity on a planar graph G (more generally for bounded-genus or excluded-minor graphs).

[1]  Maxim Sviridenko,et al.  Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts , 1999, IPCO.

[2]  Warren P. Adams,et al.  A hierarchy of relaxation between the continuous and convex hull representations , 1990 .

[3]  Ken-ichi Kawarabayashi,et al.  Contraction decomposition in h-minor-free graphs and algorithmic applications , 2011, STOC '11.

[4]  Hans L. Bodlaender,et al.  NC-Algorithms for Graphs with Small Treewidth , 1988, WG.

[5]  Daniel Bienstock,et al.  Tree-width and the Sherali-Adams operator , 2004, Discret. Optim..

[6]  Guy Kindler,et al.  Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[7]  Avner Magen,et al.  Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy , 2009, APPROX-RANDOM.

[8]  Anupam Gupta,et al.  Sparsest cut on bounded treewidth graphs: algorithms and hardness results , 2013, STOC '13.

[9]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[10]  Vahab S. Mirrokni,et al.  Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints , 2009, SIAM J. Discret. Math..

[11]  J. Vondrák,et al.  Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes , 2014 .

[12]  Refael Hassin,et al.  A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts , 2001, SIAM J. Discret. Math..

[13]  Jan Vondrák,et al.  Maximizing a Monotone Submodular Function Subject to a Matroid Constraint , 2011, SIAM J. Comput..

[14]  Madhur Tulsiani,et al.  Linear Programming Hierarchies Suffice for Directed Steiner Tree , 2014, IPCO.

[15]  Joseph Naor,et al.  A Unified Continuous Greedy Algorithm for Submodular Maximization , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[16]  Vladimir Kolmogorov,et al.  Graph cut based image segmentation with connectivity priors , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[17]  Avner Magen,et al.  Robust Algorithms for Max Independent Set on Minor-Free Graphs Based on the Sherali-Adams Hierarchy , 2009 .

[18]  Venkatesan Guruswami,et al.  MaxMin allocation via degree lower-bounded arborescences , 2009, STOC '09.

[19]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems , 1994, Discret. Appl. Math..

[20]  Mohammad Taghi Hajiaghayi,et al.  Approximation Algorithms for Connected Maximum Cut and Related Problems , 2015, ESA.

[21]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[22]  Amin Saberi,et al.  INFORMS doi 10.1287/xxxx.0000.0000 c○0000 INFORMS Price of Correlations in Stochastic Optimization , 2022 .

[23]  Jan Vondrák,et al.  Submodular Maximization over Multiple Matroids via Generalized Exchange Properties , 2009, Math. Oper. Res..

[24]  Ken-ichi Kawarabayashi,et al.  Algorithmic graph minor theory: Decomposition, approximation, and coloring , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[25]  Kang-Won Lee,et al.  Minimum Congestion Mapping in a Cloud , 2015, SIAM J. Comput..