Near-Optimal Distributed Tree Embedding
Authors:
- 1 January 2014
- book chapter
- Published by Springer Nature
- p. 197-211
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set2014
- Distributed verification and hardness of distributed approximation2011
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphsRandom Structures & Algorithms, 2006
- A tight bound on approximating arbitrary metrics by tree metricsJournal of Computer and System Sciences, 2004
- Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem2004
- A tight bound on approximating arbitrary metrics by tree metrics2003
- On approximating arbitrary metrices by tree metrics1998
- Size-Estimation Framework with Applications to Transitive Closure and ReachabilityJournal of Computer and System Sciences, 1997
- A Graph-Theoretic Game and Its Application to the k-Server ProblemSIAM Journal on Computing, 1995
- On lipschitz embedding of finite metric spaces in Hilbert spaceIsrael Journal of Mathematics, 1985