AbstractMetric MAX-CUT is the problem of dividing a set of points in metric space into two parts so as to maximize the sum of the distances between points belonging to distinct parts. We show that metric MAX-CUT is NP-complete but has a polynomial time randomized approximation scheme
This report constitutes a close review of Williamson and Goemans ’ random-ized approximation algorit...
The next technique we learn is designing approximation algorithms using rounding semidefinite progra...
We consider the problem of partitioning the vertices of a weighted graph into two sets of sizes that...
AbstractMetric MAX-CUT is the problem of dividing a set of points in metric space into two parts so ...
AbstractWe consider the problem of partitioning the vertices of a weighted graph into two sets of si...
In this paper, after introducing a new semidefinite programming formulation we present an improved r...
Given a graph with positive integer edge weights one may ask whether there exists an edge cut whose ...
We design polynomial time approximation schemes (PTASs) for Metric MINBISECTION, i.e. dividing a giv...
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiab...
This thesis investigates various computational approaches to the Maximum Cut problem. It is generall...
In the Maximum Cut with Limited Unbalance problem, we want to partition the vertices of a weighted g...
Given an undirected graph with edge weights, the MAX-CUT problem consists in finding a partition of ...
AbstractWe consider a generalization of the classical MAX-CUT problem where two objective functions ...
International audienceWe consider a generalization of the classical MAX-CUT problem where two object...
Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimizatio...
This report constitutes a close review of Williamson and Goemans ’ random-ized approximation algorit...
The next technique we learn is designing approximation algorithms using rounding semidefinite progra...
We consider the problem of partitioning the vertices of a weighted graph into two sets of sizes that...
AbstractMetric MAX-CUT is the problem of dividing a set of points in metric space into two parts so ...
AbstractWe consider the problem of partitioning the vertices of a weighted graph into two sets of si...
In this paper, after introducing a new semidefinite programming formulation we present an improved r...
Given a graph with positive integer edge weights one may ask whether there exists an edge cut whose ...
We design polynomial time approximation schemes (PTASs) for Metric MINBISECTION, i.e. dividing a giv...
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2-satisfiab...
This thesis investigates various computational approaches to the Maximum Cut problem. It is generall...
In the Maximum Cut with Limited Unbalance problem, we want to partition the vertices of a weighted g...
Given an undirected graph with edge weights, the MAX-CUT problem consists in finding a partition of ...
AbstractWe consider a generalization of the classical MAX-CUT problem where two objective functions ...
International audienceWe consider a generalization of the classical MAX-CUT problem where two object...
Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimizatio...
This report constitutes a close review of Williamson and Goemans ’ random-ized approximation algorit...
The next technique we learn is designing approximation algorithms using rounding semidefinite progra...
We consider the problem of partitioning the vertices of a weighted graph into two sets of sizes that...
DOI
Add to ORKG