A randomized approximation scheme for metric MAX-CUT

Journal of Computer and System Sciences

Volumn 63, Issue 4, 2001, Pages 531-541

  Fernandez De La Vega, W ^a   Kenyon, Claire ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; OPTIMIZATION; POLYNOMIAL APPROXIMATION; RANDOM PROCESSES; SET THEORY; TIME SERIES ANALYSIS;

METRIC SPACE; POLYNOMIAL TIME APPROXIMATION; RANDOMIZED APPROXIMATION;

COMPUTATIONAL COMPLEXITY;

EID: 0035733685     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2001.1772     Document Type: Article

References (24)

1. Polynomial time approximation schemes for euclidean TSP and other geometric problems
2. Nearly linear time approximation schemes for euclidean TSP and other geometric problems
3. Approximation schemes for dense instances of NP-hard problems
4. Proof verification and the hardness of approximation problems
5. On clustering problems with connected optima in euclidean spaces
6. Geometric clusterings
7. Combinatorial properties and the complexity of a MAX-CUT approximation
8. Laplacian eigenvalues and the maximum cut problem
9. MAX-CUT has a randomized approximation scheme in dense graphs
10. Polynomial time approximation of dense weighted instances of MAX-CUT
11. A randomized approximation scheme for metric MAX-CUT
12. Quick approximations to matrices and applications
13. Computers and intractability
14. 878-approximation algorithms for MAX-CUT and MAX-2SAT
15. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
16. Property testing and its connection to learning and approximation
17. Finding tailored partitions
18. Approximation algorithms for NP-hard problems
19. Application of weighted voronoi diagrams and randomization of variances-based k-clustering
20. A sublinear-time approximation scheme for clustering in metric spaces
21. Optimization, approximation and complexity classes
22. Solving the MAX-CUT problem using eigenvalues
23. P-complete approximation problems
24. When Hamming meets Euclid: The approximability of geometric TSP and MST (extended abstract)