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
AbstractWe consider a generalization of the classical MAX-CUT problem where two objective functions ...
AbstractAn approximation algorithm for the maximum cut problem is designed and analyzed; its perform...
The next technique we learn is designing approximation algorithms using rounding semidefinite progra...
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...
Given a graph with positive integer edge weights one may ask whether there exists an edge cut whose ...
For many optimization problems, the instances of practical interest often occupy just a tiny part of...
In this paper we compare, from a practical point of view, approximation algorithms for the problem M...
The max-cut problem asks for partitioning the nodes V of a graph G=(V,E) into two sets (one of which...
© 2019 American Institute of Mathematical Sciences. All rights reserved. The Max-Cut problem is a we...
In the Maximum Cut with Limited Unbalance problem, we want to partition the vertices of a weighted g...
Given an undirected graph G = (V,E), a cut in G is a subset S ⊆ V. Let S = V \S, and let E(S,S) deno...
We consider the problem of partitioning the vertices of a weighted graph into two sets of sizes that...
Given an undirected graph with edge weights, the MAX-CUT problem consists in finding a partition of ...
The max-cut problem asks for partitioning the nodes V of a graph G=(V,E) into two sets (one of which...
AbstractWe consider a generalization of the classical MAX-CUT problem where two objective functions ...
AbstractAn approximation algorithm for the maximum cut problem is designed and analyzed; its perform...
The next technique we learn is designing approximation algorithms using rounding semidefinite progra...
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...
Given a graph with positive integer edge weights one may ask whether there exists an edge cut whose ...
For many optimization problems, the instances of practical interest often occupy just a tiny part of...
In this paper we compare, from a practical point of view, approximation algorithms for the problem M...
The max-cut problem asks for partitioning the nodes V of a graph G=(V,E) into two sets (one of which...
© 2019 American Institute of Mathematical Sciences. All rights reserved. The Max-Cut problem is a we...
In the Maximum Cut with Limited Unbalance problem, we want to partition the vertices of a weighted g...
Given an undirected graph G = (V,E), a cut in G is a subset S ⊆ V. Let S = V \S, and let E(S,S) deno...
We consider the problem of partitioning the vertices of a weighted graph into two sets of sizes that...
Given an undirected graph with edge weights, the MAX-CUT problem consists in finding a partition of ...
The max-cut problem asks for partitioning the nodes V of a graph G=(V,E) into two sets (one of which...
AbstractWe consider a generalization of the classical MAX-CUT problem where two objective functions ...
AbstractAn approximation algorithm for the maximum cut problem is designed and analyzed; its perform...
The next technique we learn is designing approximation algorithms using rounding semidefinite progra...
DOI
Add to ORKG