On the public citation graph
Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs
0 signed · 100 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-52846-6_75openalex-snapshot
Generating sparse spanners for weighted graphs
inferredcites →https://doi.org/10.1007/bf00247467openalex-snapshot
Hilbert's metric and positive contraction mappings in a Banach space
inferredcites →https://doi.org/10.1007/bf01200757openalex-snapshot
The geometry of graphs and some of its algorithmic applications
inferredcites →https://doi.org/10.1007/bf02189308openalex-snapshot
On sparse spanners of weighted graphs
inferredcites →https://doi.org/10.1007/bf02776078openalex-snapshot
On lipschitz embedding of finite metric spaces in Hilbert space
inferredcites →https://doi.org/10.1016/b978-0-08-016160-0.50028-2openalex-snapshot
ELEMENTS OF ALGEBRAIC TOPOLOGY
inferredcites →https://doi.org/10.1090/conm/026/737400openalex-snapshot
Extensions of Lipschitz mappings into a Hilbert space
inferredcites →https://doi.org/10.1090/s0002-9947-1985-0776391-5openalex-snapshot
On isometric embeddings of graphs
inferredcites →https://doi.org/10.1137/0218050openalex-snapshot
An Optimal Synchronizer for the Hypercube
inferredcites →https://doi.org/10.1145/4221.4227openalex-snapshot
Complexity of network synchronization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.2000.1118openalex-snapshot
Improved Bandwidth Approximation for Trees and Chordal Graphs
inferred← citeshttps://doi.org/10.1007/11496199_44openalex-snapshot
Assign Ranges in General Ad-Hoc Networks
inferred← citeshttps://doi.org/10.1007/11830924_9openalex-snapshot
A Tight Lower Bound for the Steiner Point Removal Problem on Trees
inferred← citeshttps://doi.org/10.1007/3-540-36206-1_27openalex-snapshot
Lower Bounds for Embedding Graphs into Graphs of Smaller Characteristic
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_25openalex-snapshot
Approximating Metric Spaces by Tree Metrics
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_25openalex-snapshot
Approximating Metric Spaces by Tree Metrics
inferred← citeshttps://doi.org/10.1007/978-3-030-73879-2_23openalex-snapshot
Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators
inferred← citeshttps://doi.org/10.1007/978-3-319-30961-3_15openalex-snapshot
Metric Characterizations of Some Classes of Banach Spaces
inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_21openalex-snapshot
Approximation Algorithms for Minimizing Average Distortion
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_15openalex-snapshot
Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families
inferred← citeshttps://doi.org/10.1007/978-3-540-74208-1_18openalex-snapshot
Maximum Gradient Embeddings and Monotone Clustering
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_8openalex-snapshot
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_1-2openalex-snapshot
Abelian Hidden Subgroup Problem
inferred← citeshttps://doi.org/10.1007/s00454-011-9386-0openalex-snapshot
Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/s00493-004-0015-xopenalex-snapshot
Cuts, Trees and ℓ1-Embeddings of Graphs*
inferred← citeshttps://doi.org/10.1007/s00493-010-2302-zopenalex-snapshot
Maximum gradient embeddings and monotone clustering
inferred← citeshttps://doi.org/10.1007/s00493-013-2685-8openalex-snapshot
Pathwidth, trees, and random embeddings
inferred← citeshttps://doi.org/10.1007/s10107-013-0713-5openalex-snapshot
Tree metrics and edge-disjoint $$S$$ S -paths
inferred← citeshttps://doi.org/10.1007/s10107-022-01780-0openalex-snapshot
Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators
inferred← citeshttps://doi.org/10.1007/s10240-013-0053-2openalex-snapshot
Nonlinear spectral calculus and super-expanders
inferred← citeshttps://doi.org/10.1007/s43037-024-00373-7openalex-snapshot
Stochastic embeddings of graphs into trees
inferred← citeshttps://doi.org/10.1016/j.acha.2016.06.008openalex-snapshot
The mixed Lipschitz space and its dual for tree metrics
inferred← citeshttps://doi.org/10.1016/j.aim.2011.08.003openalex-snapshot
Advances in metric embedding theory
inferred← citeshttps://doi.org/10.1016/j.comgeo.2016.08.003openalex-snapshot
Metric embedding, hyperbolic space, and social networks
inferred← citeshttps://doi.org/10.1016/j.dam.2017.10.025openalex-snapshot
Tree spanners of bounded degree graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2016.08.003openalex-snapshot
Nonexistence of embeddings with uniformly bounded distortions of Laakso graphs into diamond graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.04.011openalex-snapshot
A tight bound on approximating arbitrary metrics by tree metrics
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.02.008openalex-snapshot
On approximating tree spanners that are breadth first search trees
inferred← citeshttps://doi.org/10.1016/j.jcss.2022.06.001openalex-snapshot
Covering metric spaces by few trees
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.10.010openalex-snapshot
Assign ranges in general ad-hoc networks
inferred← citeshttps://doi.org/10.1016/j.neunet.2024.106420openalex-snapshot
Capacity bounds for hyperbolic neural network representations of latent tree structures
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00161-2openalex-snapshot
On approximating planar metrics by tree metrics
inferred← citeshttps://doi.org/10.1090/proc/13750openalex-snapshot
Distortion of embeddings of binary trees into diamond graphs
inferred← citeshttps://doi.org/10.1109/focs.2008.79openalex-snapshot
Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums
inferred← citeshttps://doi.org/10.1109/focs.2010.62openalex-snapshot
One Tree Suffices: A Simultaneous O(1)-Approximation for Single-Sink Buy-at-Bulk
inferred← citeshttps://doi.org/10.1109/focs.2019.00069openalex-snapshot
Truly Optimal Euclidean Spanners
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548477openalex-snapshot
Probabilistic approximation of metric spaces and its algorithmic applications
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743488openalex-snapshot
Approximating a finite metric by a small number of tree metrics
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959878openalex-snapshot
Algorithmic applications of low-distortion geometric embeddings
inferred← citeshttps://doi.org/10.1109/sfcs.2005.51openalex-snapshot
Metric Embeddings with Relaxed Guarantees
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814611openalex-snapshot
Cuts, trees and l/sub 1/-embeddings of graphs
inferred← citeshttps://doi.org/10.1112/blms.12657openalex-snapshot
Stochastic approximation of lamplighter metrics
inferred← citeshttps://doi.org/10.1137/060670511openalex-snapshot
Metric Embeddings with Relaxed Guarantees
inferred← citeshttps://doi.org/10.1137/090745441openalex-snapshot
A Tight Upper Bound on the Probabilistic Embedding of Series-Parallel Graphs
inferred← citeshttps://doi.org/10.1137/090780304openalex-snapshot
Local Versus Global Properties of Metric Spaces
inferred← citeshttps://doi.org/10.1137/1.9781611975994.64openalex-snapshot
Lossless Prioritized Embeddings
inferred← citeshttps://doi.org/10.1137/120884390openalex-snapshot
Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion
inferred← citeshttps://doi.org/10.1137/17m1118749openalex-snapshot
Prioritized Metric Structures and Embedding
inferred← citeshttps://doi.org/10.1137/18m1210678openalex-snapshot
The Greedy Spanner Is Existentially Optimal
inferred← citeshttps://doi.org/10.1137/s0097539703433122openalex-snapshot
Multiembedding of Metric Spaces
inferred← citeshttps://doi.org/10.1137/s009753979732253xopenalex-snapshot
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
inferred← citeshttps://doi.org/10.1145/1007912.1007929openalex-snapshot
Lower bounds for graph embeddings and combinatorial preconditioners
inferred← citeshttps://doi.org/10.1145/1132516.1132557openalex-snapshot
Advances in metric embedding theory
inferred← citeshttps://doi.org/10.1145/1247069.1247107openalex-snapshot
Probabilistic embeddings of bounded genus graphs into planar graphs
inferred← citeshttps://doi.org/10.1145/1281100.1281110openalex-snapshot
Reconstructing approximate tree metrics
inferred← citeshttps://doi.org/10.1145/1536414.1536450openalex-snapshot
On the geometry of graphs with a forbidden minor
inferred← citeshttps://doi.org/10.1145/1555349.1555357openalex-snapshot
On the treeness of internet latency and bandwidth
inferred← citeshttps://doi.org/10.1145/2582112.2582139openalex-snapshot
Metric Embedding, Hyperbolic Space, and Social Networks
inferred← citeshttps://doi.org/10.1145/2746539.2746623openalex-snapshot
Prioritized Metric Structures and Embedding
inferred← citeshttps://doi.org/10.1145/276698.276725openalex-snapshot
On approximating arbitrary metrices by tree metrics
inferred← citeshttps://doi.org/10.1145/2933057.2933114openalex-snapshot
The Greedy Spanner is Existentially Optimal
inferred← citeshttps://doi.org/10.1145/3323165.3323181openalex-snapshot
The Arvy Distributed Directory Protocol
inferred← citeshttps://doi.org/10.1145/3406325.3451043openalex-snapshot
Clan embeddings into trees, and low treewidth graphs
inferred← citeshttps://doi.org/10.1145/3558481.3591096openalex-snapshot
Massively Parallel Tree Embeddings for High Dimensional Spaces
inferred← citeshttps://doi.org/10.1145/780542.780608openalex-snapshot
A tight bound on approximating arbitrary metrics by tree metrics
inferred← citeshttps://doi.org/10.1184/r1/6609899openalex-snapshot
Steiner points in tree metrics don't (really) help
inferred← citeshttps://doi.org/10.1215/00192082-10414720openalex-snapshot
Approximating spaces of Nagata dimension zero by weighted trees
inferred← citeshttps://doi.org/10.22456/2175-2745.49694openalex-snapshot
Programação matemática e imersões métricas para aproximações em problemas de corte
inferred← citeshttps://doi.org/10.2478/agms-2014-0005openalex-snapshot
Metric Characterizations of Superreflexivity in Terms of Word Hyperbolic Groups and Finite Graphs
inferred← citeshttps://doi.org/10.47749/t/unicamp.2018.1014622openalex-snapshot
Parking permit and network leasing problems
inferred← citeshttps://doi.org/10.48550/arxiv.0806.4722openalex-snapshot
Malleable Coding: Compressed Palimpsests
inferred← citeshttps://doi.org/10.48550/arxiv.1301.3252openalex-snapshot
Approximating Metrics by Tree Metrics of Small Distance-Weighted Average Stretch
inferred← citeshttps://doi.org/10.48550/arxiv.1402.3573openalex-snapshot
Tree 3-spanners of diameter at most 5
inferred← citeshttps://doi.org/10.48550/arxiv.1503.06063openalex-snapshot
Tree spanners of small diameter
inferred← citeshttps://doi.org/10.48550/arxiv.1904.12042openalex-snapshot
Truly Optimal Euclidean Spanners
inferred← citeshttps://doi.org/10.48550/arxiv.2104.07872openalex-snapshot
Quantitative characteristics of cycles and their relations with stretch and spanning tree congestion
inferred← citeshttps://doi.org/10.5555/1109557.1109673openalex-snapshot
A tight upper bound on the probabilistic embedding of series-parallel graphs
inferred← citeshttps://doi.org/10.5555/1283383.1283437openalex-snapshot
Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
inferred← citeshttps://doi.org/10.5555/644108.644112openalex-snapshot
Property testing of data dimensionality
inferred← citeshttps://doi.org/10.5555/644108.644177openalex-snapshot
Multi-embedding and path approximation of metric spaces
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.