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 Ω(logn). 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arora, S., Lee, J., Naor, A.: Euclidean distortion and the sparsest cut. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC’05, pp. 553–562. ACM Press, New York (2005)
Alon, N., Roichman, Y.: Random Cayley graphs and expanders. Random Structures Appl. 5, 271–284 (1994)
Aumann, Y., Rabani, Y.: An O(logk) Approximate min-cut max-flow theorem and approximation algorithm. SIAM Journal on Computing 27(1), 291–301 (1998)
Bourgain, J.: On Lipschitz embeddings of finite metric spaces in Hilbert space. Israel Journal of Mathematics 52(1-2), 46–52 (1985)
Chawla, S., Gupta, A., Räcke, H.: Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut. In: Proceedings of the 16’th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’05, pp. 102–111. ACM Press, New York (2005)
Gupta, A., Krauthgamer, R., Lee, J.: Bounded Geometries, Fractals, and Low-Distortion Embeddings. In: Proceedings of the 44th Annual Symposium on Foundations of CS, FOCS’03, pp. 534–543 (2003)
Justesen, J.: A class of constructive asymptotically good algebraic codes. IEEE Transactions on Information 18, 652–656 (1972)
Khot, S., Naor, A.: Nonembeddability theorems via Fourier analysis. In: Proceedings of 46th Annual Symposium of FOCS 2005, pp. 101–112 (2005)
Klein, P., Plotkin, S., Rao, S.: Excluded minors, network decomposition, and multicommodity flow. In: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pp. 682–690. ACM Press, New York (1993)
Linial, N., London, E., Rabinovich, Y.: The geometry of graphs and some of its algorithmic applications. Combinatorica 15(2), 215–245 (1995)
Matousek, J.: Lectures on Discrete Geometry. Springer, Heidelberg (2002)
Linial, N., Wigderson, A.: Expander Graphs and their Applications. Bulletin of the American Math. Society 43(4), 439–561 (2006)
Wigderson, A., Xiao, D.: Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications. In: Electronic Colloquium on Computational Complexity, Report TR06-105, 13th Year, 105th Report
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Newman, I., Rabinovich, Y. (2007). Hard Metrics from Cayley Graphs of Abelian Groups. In: Thomas, W., Weil, P. (eds) STACS 2007. STACS 2007. Lecture Notes in Computer Science, vol 4393. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70918-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-70918-3_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70917-6
Online ISBN: 978-3-540-70918-3
eBook Packages: Computer ScienceComputer Science (R0)