The following pages link to Algorithms – ESA 2004 (Q5464569):
Displayed 12 items.
- A simple proof of Dvoretzky-type theorem for Hausdorff dimension in doubling spaces (Q2143363) (← links)
- Covering metric spaces by few trees (Q2168848) (← links)
- On notions of distortion and an almost minimum spanning tree with constant average distortion (Q2316932) (← links)
- Terminal embeddings (Q2405893) (← links)
- Using Petal-Decompositions to Build a Low Stretch Spanning Tree (Q4629391) (← links)
- Min-Cost Bipartite Perfect Matching with Delays (Q5002601) (← links)
- Covering Metric Spaces by Few Trees (Q5091169) (← links)
- Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion (Q5252661) (← links)
- Cutting Corners Cheaply, or How to Remove Steiner Points (Q5502176) (← links)
- Advances in metric embedding theory (Q5894374) (← links)
- Local embeddings of metric spaces (Q5919791) (← links)
- Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions (Q6154194) (← links)