Abstract: In this article we propose a new hybrid local search approximation algorithm for solving the capacitated Max-k-cut problem and contrast its performance with two local search approximation ...

Improved Streaming Algorithms for Maximum Directed Cut via Smoothed Snapshots Abstract: We give an $\widetilde{O}(\sqrt{n})$-space single-pass 0.483-approximation streaming algorithm for estimating ...

This repository contains a simple implementation maxcut.py in Python using CVXPY [1] of Goemans-Williamson algorithm [2] for Max-Cut problem of finding a maximum cut of a graph. Figure 1A shows ...

7 This task is easier in some “nonstandard” streaming models. Firstly, suppose we were guaranteed that the edges showed up in the stream in a uniformly random order .Then since the first \(T\) edges ...

Two decades ago, for example, research for min-cut led to graph sparsification, a concept that facilitated breakthrough scalable algorithms for electrical flows. This, in turn, intensified the search ...

These problems will involve the material you have learned in this class: linear programming, integer programming, approximation algorithms and traveling salesperson problem. It will involve ...