Metric structures in L_1: Dimension, snowflakes, and average distortion

Simple item page
dc.creatorLee, James R.
dc.creatorMendel, Manor
dc.creatorNaor, Assaf
dc.date2004-07-15
dc.date.accessioned2026-07-07T06:24:28Z
dc.date.available2026-07-07T06:24:28Z
dc.descriptionWe study the metric properties of finite subsets of L_1. The analysis of such metrics is central to a number of important algorithmic problems involving the cut structure of weighted graphs, including the Sparsest Cut Problem, one of the most compelling open problems in the field of approximation algorithms. Additionally, many open questions in geometric non-linear functional analysis involve the properties of finite subsets of L_1.
dc.description9 pages, 1 figure. To appear in European Journal of Combinatorics. Preliminary version appeared in LATIN '04
dc.identifierhttps://arxiv.org/abs/math/0407278
dc.identifierhttp://arxiv.org/abs/math/0407278
dc.identifierEuropean J. Combinatorics 26(8): 1180-1190,2005
dc.identifierdoi:10.1016/j.ejc.2004.07.002
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/96554
dc.subjectMetric Geometry
dc.subjectCombinatorics
dc.titleMetric structures in L_1: Dimension, snowflakes, and average distortion
dc.typetext

Files

Collections

arXiv