Hard metrics from Cayley graphs of abelian groups

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

Abstract

Hard metrics are the class of extremal metrics with respect to embedding into Euclidean Spaces: their distortion is as bad as it possibly gets, which is Ω(log n). Besides being very interesting objects akin to expanders and good codes, with rich structure of independent interest, such metrics are important for obtaining lower bounds in Combinatorial Optimization, e.g., on the value of MinCut/MaxFlow ratio for multicommodity flows. For more than a decade, a single family of hard metrics was known (see [10,3]). Recently, a different such family was found (see [8]), causing a certain excitement among the researchers in the area. In this paper we present another construction of hard metrics, different from [10,3], and more general yet clearer and simpler than [8]. Our results naturally extend to NEG and to ℓ1.

Original languageEnglish
Title of host publicationSTACS 2007 - 24th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings
PublisherSpringer Verlag
Pages157-162
Number of pages6
ISBN (Print)9783540709176
DOIs
StatePublished - 2007
Event24th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2007 - Aachen, Germany
Duration: 22 Feb 200724 Feb 2007

Publication series

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

Conference

Conference24th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2007
Country/TerritoryGermany
CityAachen
Period22/02/0724/02/07

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Hard metrics from Cayley graphs of abelian groups'. Together they form a unique fingerprint.

Cite this