Algorithms – ESA 2004
From MaRDI portal
Publication:5464569
DOI10.1007/b100428zbMath1111.68555OpenAlexW2483610301MaRDI QIDQ5464569
Publication date: 18 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100428
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25)
Related Items (12)
A simple proof of Dvoretzky-type theorem for Hausdorff dimension in doubling spaces ⋮ Covering metric spaces by few trees ⋮ Terminal embeddings ⋮ Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions ⋮ Using Petal-Decompositions to Build a Low Stretch Spanning Tree ⋮ Advances in metric embedding theory ⋮ Min-Cost Bipartite Perfect Matching with Delays ⋮ Local embeddings of metric spaces ⋮ Covering Metric Spaces by Few Trees ⋮ On notions of distortion and an almost minimum spanning tree with constant average distortion ⋮ Cutting Corners Cheaply, or How to Remove Steiner Points ⋮ Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion
This page was built for publication: Algorithms – ESA 2004
