Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems

12/19/2018
by   Sepehr Abbasi-Zadeh, et al.
0

Semidefinite programming is a powerful tool in the design and analysis of approximation algorithms for combinatorial optimization problems. In particular, the random hyperplane rounding method of Goemans and Williamson, has been extensively studied for more than two decades, resulting in various extensions to the original technique and beautiful algorithms for a wide range of applications. Despite the fact that this approach yields tight approximation guarantees for some problems, e.g., Max-Cut, for many others, e.g., Max-Sat and Max-DiCut, the tight approximation ratio is still unknown. One of the main reasons for this is the fact that very few techniques for rounding semi-definite relaxations are known. In this work, we present a new general and simple method for rounding semi-definite programs, based on Brownian motion. Our approach is inspired by recent results in algorithmic discrepancy theory. We develop and present tools for analyzing our new rounding algorithms, utilizing mathematical machinery from the theory of Brownian motion, complex analysis, and partial differential equations. Focusing on constraint satisfaction problems, we apply our method to several classical problems, including Max-Cut, Max-2SAT, and Max-DiCut, and derive new algorithms that are competitive with the best known results. We further show the versatility of our approach by presenting simple and natural variants of it, and we numerically demonstrate that they exhibit nearly optimal approximation guarantees for some problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/27/2018

Complex Semidefinite Programming and Max-k-Cut

In a second seminal paper on the application of semidefinite programming...
research
09/19/2019

Almost optimal classical approximation algorithms for a quantum generalization of Max-Cut

Approximation algorithms for constraint satisfaction problems (CSPs) are...
research
08/08/2022

Combinatorial Optimization via the Sum of Squares Hierarchy

We study the Sum of Squares (SoS) Hierarchy with a view towards combinat...
research
10/29/2021

Classifying Approximation Algorithms: Understanding the APX Complexity Class

We are interested in the intersection of approximation algorithms and co...
research
02/28/2022

Improved Combinatorial Approximation Algorithms for MAX CUT in Sparse Graphs

The Max-Cut problem is a fundamental NP-hard problem, which is attractin...
research
08/07/2023

An Improved Approximation Algorithm for the Max-3-Section Problem

We consider the Max-3-Section problem, where we are given an undirected ...
research
12/09/2018

Rounding semidefinite programs for large-domain problems via Brownian motion

We present a new simple method for rounding a semidefinite programming r...

Please sign up or login with your details

Forgot password? Click here to reset