Algorithms – ESA 2004
From MaRDI portal
Publication:5464569
DOI10.1007/b100428zbMath1111.68555MaRDI 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
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
68W25: Approximation algorithms
Related Items
Using Petal-Decompositions to Build a Low Stretch Spanning Tree, Min-Cost Bipartite Perfect Matching with Delays, Covering Metric Spaces by Few Trees, Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion, Cutting Corners Cheaply, or How to Remove Steiner Points, Advances in metric embedding theory, Local embeddings of metric spaces, Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions, A simple proof of Dvoretzky-type theorem for Hausdorff dimension in doubling spaces, Covering metric spaces by few trees, On notions of distortion and an almost minimum spanning tree with constant average distortion, Terminal embeddings