scientific article
From MaRDI portal
Publication:2768295
zbMath0990.05033MaRDI QIDQ2768295
Publication date: 24 March 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (29)
Metric Characterizations of Some Classes of Banach Spaces ⋮ Terminal embeddings ⋮ Prioritized Metric Structures and Embedding ⋮ Stochastic approximation of lamplighter metrics ⋮ Approximating spaces of Nagata dimension zero by weighted trees ⋮ Reachability Preservers: New Extremal Bounds and Approximation Algorithms ⋮ Lipschitz-free Spaces on Finite Metric Spaces ⋮ Online Spanners in Metric Spaces ⋮ Unnamed Item ⋮ Vertex Sparsification in Trees ⋮ Minimum restricted diameter spanning trees. ⋮ Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs ⋮ Steiner Point Removal with Distortion $O(\log {k})$ using the Relaxed-Voronoi Algorithm ⋮ Distributed transactional memory for general networks ⋮ Bayesian ignorance ⋮ Approximating snowflake metrics by trees ⋮ A tight bound on approximating arbitrary metrics by tree metrics ⋮ Refined Vertex Sparsifiers of Planar Graphs ⋮ Improved Guarantees for Vertex Sparsification in Planar Graphs ⋮ Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators ⋮ Unnamed Item ⋮ Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators ⋮ Distance-Preserving Graph Contractions ⋮ A note on the subadditive network design problem ⋮ Distance-Preserving Subgraphs of Interval Graphs ⋮ Distance-Preserving Graph Contractions ⋮ Cutting Corners Cheaply, or How to Remove Steiner Points ⋮ Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones ⋮ An analysis framework for distributed hierarchical directories
This page was built for publication:
