Clustering for edge-cost minimization (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Polynomial-time approximation schemes for geometric min-sum median clustering
Journal of the ACM (JACM)
A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Approximation Schemes for Geometric NP-Hard Problems: A Survey
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Approximation schemes for clustering problems
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A Sublinear Time Approximation Scheme for Clustering in Metric Spaces
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Approximation schemes for Metric Bisection and partitioning
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Tensor decomposition and approximation schemes for constraint satisfaction problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Correlation clustering with a fixed number of clusters
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Knowledge Based Image Annotation Refinement
Journal of Signal Processing Systems
Universal ε-approximators for integrals
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Data reduction for weighted and outlier-resistant clustering
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
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.