# A Randomized Approximation Scheme for Metric MAX-CUT

@article{Vega1998ARA, title={A Randomized Approximation Scheme for Metric MAX-CUT}, author={Wenceslas Fernandez de la Vega and Claire Mathieu}, journal={J. Comput. Syst. Sci.}, year={1998}, volume={63}, pages={531-541} }

Metric 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 has a polynomial time randomized approximation scheme.

## 69 Citations

### NP-hardness of the Euclidean Max-Cut problem

- Mathematics
- 2014

We consider the problem in which given a complete edge-weighted undirected graph whose vertices are points of the q-dimensional space, it is required to find a cut of maximum total weight. Two…

### Complexity of the weighted max-cut in Euclidean space

- Mathematics
- 2014

The Max-Cut Problem is considered in an undirected graph whose vertices are points of a q-dimensional Euclidean space. The two cases are investigated, where the weights of the edges are equal to (i)…

### On Metric Clustering to Minimize the Sum of Radii

- Mathematics, Computer ScienceAlgorithmica
- 2009

A randomized algorithm that runs in nO(log n⋅logΔ) time and returns with high probability the optimal solution to the problem of covering P by k balls so as to minimize the sum of the radii of the balls.

### Optimal cuts and partitions in tree metrics in polynomial time

- Computer Science, MathematicsInf. Process. Lett.
- 2012

### Approximation schemes for Metric Bisection and partitioning

- Computer ScienceSODA '04
- 2004

We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of distances across the…

### A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs

- Computer Science, MathematicsASIAN
- 1999

The approximation ratio of the algorithm is 1:3 and improves the best known parallel approximation ratio, i.e. 2, in the special case of cubic graphs.

### Polynomial Time Approximation Schemes for Metric Min-Sum Clustering

- Computer Science, MathematicsElectron. Colloquium Comput. Complex.
- 2002

We give polynomial time approximation schemes for the problem of partitioning an input set of n points into a xed number k of clusters so as to minimize the sum over all clusters of the total…

### A sublinear time approximation scheme for clustering in metric spaces

- Computer Science, Mathematics40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
- 1999

This paper shows an approximation scheme for the metric 2-clustering problem, which involves partitioning X into two sets S(1) and S(2) in order to minimize the value of Sigmasub i/spl sub/S(i)/d(u,v).

### On greedy construction heuristics for the MAX-CUT problem

- Computer ScienceInt. J. Comput. Sci. Eng.
- 2007

A new 'worst-out' approach is studied and the proposed edge contraction heuristic is shown to have an approximation ratio of at least 1/3 and the results of experimental comparison of the worst-out approach, the well-known best-in algorithm, and modifications for both are included.

### A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem

- Computer Science, MathematicsDOOR
- 2016

An approximation algorithm is presented for the strongly NP-hard problem of partitioning a set of Euclidean points into two clusters and it is proved that it is a fully polynomial-time approximation scheme when the space dimension is bounded by a constant.

## References

SHOWING 1-10 OF 24 REFERENCES

### A randomized approximation scheme for metric MAX-CUT

- Computer ScienceProceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
- 1998

It is shown that metric MAX-CUT has a polynomial time randomized approximation scheme.

### Polynomial time approximation of dense weighted instances of MAX-CUT

- Computer Science, MathematicsRandom Struct. Algorithms
- 1998

We give the rst polynomial time approximability characterization of dense weighted instances of MAX-CUT, and some other dense weighted NP-hard problems in terms of their empirical weight…

### A sublinear time approximation scheme for clustering in metric spaces

- Computer Science, Mathematics40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
- 1999

This paper shows an approximation scheme for the metric 2-clustering problem, which involves partitioning X into two sets S(1) and S(2) in order to minimize the value of Sigmasub i/spl sub/S(i)/d(u,v).

### P-Complete Approximation Problems

- Computer ScienceJ. ACM
- 1976

For P-complete problems such as traveling salesperson, cycle covers, 0-1 integer programming, multicommodity network flows, quadratic assignment, etc., it is shown that the approximation problem is…

### Polynomial time approximation schemes for dense instances of NP-hard problems

- Computer ScienceSTOC '95
- 1995

We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut, graph bisection, graph…

### Combinatorial Properties and the Complexity of a Max-cut Approximation

- MathematicsEur. J. Comb.
- 1993

It is shown that the bound behaves in a manner similar to the max-cut for the operations of switching, vertex splitting, contraction and decomposition, and it can be adjusted for branch and bound techniques.

### Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

- Computer ScienceJACM
- 1995

This algorithm gives the first substantial progress in approximating MAX CUT in nearly twenty years, and represents the first use of semidefinite programming in the design of approximation algorithms.

### When Hamming meets Euclid: the approximability of geometric TSP and MST (extended abstract)

- Computer ScienceSTOC '97
- 1997

It is proved that the Traveling Salesperson Problem (MIN TSP) and the Minimum Steiner Tree problem (MIN ST) are Max SNP-hard (and thus NP-hard to approximate within some constant r > 1) even if all cities lie in the geometric space Rn.

### Nearly linear time approximation schemes for Euclidean TSP and other geometric problems

- Computer ScienceProceedings 38th Annual Symposium on Foundations of Computer Science
- 1997

We present a randomized polynomial time approximation scheme for Euclidean TSP in R/sup 2/ that is substantially more efficient than our earlier scheme (1996) (and the scheme of Mitchell (1996)). For…