Volume in general metric spaces
DOI10.1007/s00454-014-9615-4zbMath1307.05090OpenAlexW1985429008MaRDI QIDQ464741
Leonard J. Schulman, Ofer Neiman, Ittai Abraham, Yair Bartal
Publication date: 29 October 2014
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-014-9615-4
Graph theory (including graph drawing) in computer science (68R10) Metric spaces, metrizability (54E35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Metric embeddings -- beyond one-dimensional distortion
- Clustering to minimize the maximum intercluster distance
- On Lipschitz embedding of finite metric spaces in Hilbert space
- Approximating the bandwidth via volume respecting embeddings
- New length bounds for cycle bases
- Measured descent: A new embedding method for finite metrics
- Improved Bandwidth Approximation for Trees and Chordal Graphs
- Triangulation and embedding using small sets of beacons
- On average distortion of embedding metrics into the line and into L 1
- Volume in General Metric Spaces
- A Best Possible Heuristic for the k-Center Problem
- Dynamic Steiner Tree Problem
- Compact routing with slack in low doubling dimension
- Compact routing with slack
- Spanners with Slack
- Advances in metric embedding theory
This page was built for publication: Volume in general metric spaces