Metric clustering via consistent labeling

We design approximation algorithms for a number of fundamental optimization problems in metric spaces, namely computing separating and padded decompositions, sparse covers, and metric triangulations. Our work is the first to emphasize relative guarantees, that compare the produced solution to the optimal one for the input at hand. By contrast, the extensive previous work on these topics has sought absolute bounds that hold for every possible metric space (or for a family of metrics). While absolute bounds typically translate to relative ones, our algorithms provide significantly better relative guarantees, using a rather different algorithm. Our technical approach is to cast a number of metric clustering problems that have been well studied---but almost always as disparate problems---into a common modeling and algorithmic framework, which we call the consistent labeling problem. Having identified the common features of all of these problems, we provide a family of linear programming relaxations and simple randomized rounding procedures that achieve provably good approximation guarantees.

[1]  Aleksandrs Slivkins,et al.  Distributed approaches to triangulation and embedding , 2005, SODA '05.

[2]  Jon M. Kleinberg,et al.  Triangulation and embedding using small sets of beacons , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[3]  Robert Krauthgamer On triangulation of simple networks , 2007, SPAA '07.

[4]  Kunal Talwar,et al.  Bypassing the embedding: algorithms for low dimensional metrics , 2004, STOC '04.

[5]  James R. Lee,et al.  Genus and the geometry of the cut graph , 2010, SODA '10.

[6]  Robert Krauthgamer,et al.  Navigating nets: simple algorithms for proximity search , 2004, SODA '04.

[7]  Yuval Rabani,et al.  An improved approximation algorithm for multiway cut , 1998, STOC '98.

[8]  J. Matousek INAPPROXIMABILITY FOR METRIC EMBEDDINGS INTO R , 2010 .

[9]  Yuval Rabani,et al.  Approximation Algorithms for Graph Homomorphism Problems , 2006, APPROX-RANDOM.

[10]  Éva Tardos,et al.  Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields , 2002, JACM.

[11]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[12]  Robert Krauthgamer,et al.  Measured descent: a new embedding method for finite metrics , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[13]  Robert Krauthgamer,et al.  Bounded geometries, fractals, and low-distortion embeddings , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[14]  Mihalis Yannakakis,et al.  The Complexity of Multiterminal Cuts , 1994, SIAM J. Comput..

[15]  N Linial,et al.  Low diameter graph decompositions , 1993, Comb..

[16]  Piotr Indyk,et al.  Approximation algorithms for embedding general metrics into trees , 2007, SODA '07.

[17]  Urs Lang,et al.  Nagata dimension, quasisymmetric embeddings, and Lipschitz extensions , 2004, math/0410048.

[18]  Satish Rao,et al.  Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.

[19]  Baruch Awerbuch,et al.  Sparse partitions , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[20]  Sudipto Guha,et al.  Approximating a finite metric by a small number of tree metrics , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[21]  Jirí Matousek,et al.  Inapproximability for Metric Embeddings into R^d , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[22]  Yair Bartal,et al.  Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[23]  Satish Rao,et al.  Small distortion and volume preserving embeddings for planar and Euclidean metrics , 1999, SCG '99.

[24]  James R. Lee Metric decomposition , smooth measures , and clustering , 2004 .

[25]  Yair Bartal Graph Decomposition Lemmas and Their Role in Metric Embedding Methods , 2004, ESA.

[26]  J. Matousek,et al.  Inapproximability for metric embeddings into Rd , 2010 .

[27]  Mihalis Yannakakis,et al.  Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications , 1996, SIAM J. Comput..

[28]  Philip N. Klein,et al.  Excluded minors, network decomposition, and multicommodity flow , 1993, STOC.

[29]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1993, STOC.

[30]  Robert Krauthgamer,et al.  Algorithms on negatively curved spaces , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[31]  Oded Schwartz,et al.  On the complexity of approximating k-set packing , 2006, computational complexity.

[32]  YannakakisMihalis,et al.  On the hardness of approximating minimization problems , 1994 .

[33]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[34]  Aleksandrs Slivkins Distance estimation and object location via rings of neighbors , 2006, Distributed Computing.

[35]  Michael F. Schwartz,et al.  Locating nearby copies of replicated Internet servers , 1995, SIGCOMM '95.

[36]  Yuval Rabani,et al.  Approximation algorithms for the 0-extension problem , 2001, SODA '01.

[37]  Yuval Rabani,et al.  Low distortion maps between point sets , 2004, STOC '04.

[38]  Satish Rao,et al.  A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.

[39]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.