Maximum gradient embeddings and monotone clustering

Manor Mendel, Assaf Naor

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Let (X, dx) be an n-point metric space. We show that there exists a distribution & over non-contractive embeddings into trees f : X → T such that for every x ∈ X, ED [max v∈X\(x) dT(f(x), f(y))/dX(x, y)] < C(log n)2 where C is a universal constant. Conversely we show that the above quadratic dependence on log n cannot be improved in general. Such embeddings, which we call maximum gradient embeddings, yield a framework for the design of approximation algorithms for a wide range of clustering problems with monotone costs, including fault-tolerant versions of k-median and facility location.

Original languageEnglish
Title of host publicationApproximation, Randomization, and Combinatorial Optimization
Subtitle of host publicationAlgorithms and Techniques - 10th International Workshop, APPROX 2007 and 11th International Workshop, RANDOM 2007, Proceedings
PublisherSpringer Verlag
Pages242-256
Number of pages15
ISBN (Print)9783540742074
DOIs
StatePublished - 2007
Event10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2007 and 11th International Workshop on Randomization and Computation, RANDOM 2007 - Princeton, NJ, United States
Duration: 20 Aug 200722 Aug 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4627 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2007 and 11th International Workshop on Randomization and Computation, RANDOM 2007
Country/TerritoryUnited States
CityPrinceton, NJ
Period20/08/0722/08/07

Fingerprint

Dive into the research topics of 'Maximum gradient embeddings and monotone clustering'. Together they form a unique fingerprint.

Cite this