Sublinear time algorithms for metric space problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximation algorithms for min-sum p-clustering
Discrete Applied Mathematics
P-Complete Approximation Problems
Journal of the ACM (JACM)
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
SIAM Journal on Computing
A Randomized Approximation Scheme for Metric MAX-CUT
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Approximating min-sum k-clustering in metric spaces
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Polynomial-time approximation schemes for geometric min-sum median clustering
Journal of the ACM (JACM)
Approximation algorithms for clustering to minimize the sum of diameters
Nordic Journal of Computing
Approximability of the Minimum Bisection Problem: An Algorithmic Challenge
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Clustering Data Streams: Theory and Practice
IEEE Transactions on Knowledge and Data Engineering
Better streaming algorithms for clustering problems
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Approximation schemes for clustering problems
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Efficient Biased Sampling for Approximate Clustering and Outlier Detection in Large Data Sets
IEEE Transactions on Knowledge and Data Engineering
Model-based Clustering with Soft Balancing
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Generative model-based clustering of directional data
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
A unified framework for model-based clustering
The Journal of Machine Learning Research
Approximation schemes for Metric Bisection and partitioning
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On clusterings: Good, bad and spectral
Journal of the ACM (JACM)
Estimating the weight of metric minimum spanning trees in sublinear-time
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
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
Online geometric reconstruction
Proceedings of the twenty-second annual symposium on Computational geometry
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
Theoretical Computer Science
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
A sublinear-time approximation scheme for bin packing
Theoretical Computer Science
Foundations and Trends® in Theoretical Computer Science
Small space representations for metric min-sum k-clustering and their applications
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
A polynomial time approximation scheme for k-consensus clustering
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Integer point sets minimizing average pairwise L1 distance: What is the optimal shape of a town?
Computational Geometry: Theory and Applications
Property testing
Property testing
Online geometric reconstruction
Journal of the ACM (JACM)
Coresets for discrete integration and clustering
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Facility location in sublinear time
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Min sum clustering with penalties
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Communication-aware processor allocation for supercomputers
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Grouping objects in multi-band images using an improved eigenvector-based algorithm
Mathematical and Computer Modelling: An International Journal
EACL 2012 Proceedings of the Workshop on Computational Approaches to Deception Detection
MAPLE: a scalable architecture for maintaining packet latency measurements
Proceedings of the 2012 ACM conference on Internet measurement conference
| Hi-index | 0.00 |
The metric 2-clustering problem is defined as follows: given a metric (X; d), partition X into two sets S1 and S2 in order to minimize the value of \math\math d(u,v) i {u,v}\math Si In this paper we show an approximation scheme for this problem.