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. 
Complexity of the weighted max-cut in Euclidean space
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)
A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs
TLDR
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.
On greedy construction heuristics for the MAX-CUT problem
TLDR
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
TLDR
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.
Polynomial-Time Approximation Algorithm for the Problem of Cardinality-Weighted Variance-Based 2-Clustering with a Given Center
TLDR
A strongly NP-hard problem of partitioning a finite set of points of Euclidean space into two clusters is considered and a polynomial-time 2-approximation algorithm for solving the problem is constructed.
Approximability of the Minimum Bisection Problem: An Algorithmic Challenge
We survey some recent results on the complexity of computing approximate solutions for instances of the Minimum Bisection problem and formulate some very intriguing and still open questions about the
Optimal Cuts and Bisections on the Real Line in Polynomial Time
TLDR
This paper solves the exact complexity of geometric cuts and bisections for dimension one (the real line) by designing an exact polynomial time algorithm based on a new technique of dealing with metric equalities and their connection to dynamic programming.
Approximation Schemes for Metric Clustering Problems
TLDR
This work partitions a data set into a small number of clusters of related items and investigates their role in information retrieval and data analysis applications.
Clustering for edge-cost minimization (extended abstract)
TLDR
A randomized approximation algorithm is obtained for partitioning a set of n points into clusters, so as to minimize the sum, over all intracluster pairs of points, of the cost associated with each pair.
Approximation Complexity of Nondense Instances of MAX-CUT
We prove existence of approximation schemes for instances of MAXCUT with Ω( 2 ∆ ) edges which work in 2 O ( ∆ e2 ) nO(1) time. This entails in particular existence of quasi-polynomial approximation
...
...

References

SHOWING 1-10 OF 25 REFERENCES
Polynomial time approximation of dense weighted instances of MAX-CUT
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
P-Complete Approximation Problems
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
Combinatorial Properties and the Complexity of a Max-cut Approximation
TLDR
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
TLDR
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.
.879-approximation algorithms for MAX CUT and MAX 2SAT
TLDR
This research presents randomized approximation algorithms for the MAX CUT and MAX 2SAT problems that always deliver solutions of expected value at least .87856 times the optimal value 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)
TLDR
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.
Solving the Max-cut Problem Using Eigenvalues
Laplacian eigenvalues and the maximum cut problem
TLDR
An eigenvalue upper boundϕ(G) on the maximum cut mc (G) of a weighted graph has several interesting properties that resemble the behaviour ofmc (G), and ϕ is subadditive with respect to amalgam, and additive withrespect to disjoint sum and 1-sum.
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
  • Sanjeev Arora
  • Computer Science
    Proceedings of 37th Conference on Foundations of Computer Science
  • 1996
TLDR
A polynomial time approximation scheme for Euclidean TSP in /spl Rfr//sup 2/ that finds a (1+/spl epsiv/)-approximation to the optimum traveling salesman tour in time n/sup 0(1//spl ePSiv/)/.
Optimization, Approximation, and Complexity Classes
TLDR
A natural variant of NP, MAX NP, and also a subclass called MAX SNP are defined, which contain several natural, well-studied classes of optimization problems, and it is shown that problems in these classes can be approximated with some bounded error.
...
...