Computing Best Swaps in Optimal Tree Spanners-Reference-Cited by-同舟云学术

Computing Best Swaps in Optimal Tree Spanners

Published:2008 Issue: Volume: Page:716-727
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Das Shantanu,Gfeller Beat,Widmayer Peter

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-92182-0_63

Reference15 articles.

1. Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest common ancestors: a survey and a new algorithm for a distributed environment. Theory Comput. Syst. 37(3), 441–456 (2004)

2. Cai, L., Corneil, D.: Tree Spanners. SIAM J. Discr. Math. 8(3), 359–387 (1995)

3. Das, S., Gfeller, B., Widmayer, P.: Computing Best Swaps in Optimal Tree Spanners. Technical Report 607, ETH Zurich (September 2008), http://www.inf.ethz.ch/research/disstechreps/techreports

4. Dixon, B., Rauch, M., Tarjan, R.: Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time. SIAM J. Comp. 21(6), 1184–1192 (1992)

5. Emek, Y., Peleg, D.: Approximating Minimum Max-Stretch spanning Trees on unweighted graphs. In: SODA 2004: Proceedings of the fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA, 2004. Society for Industrial and Applied Mathematics, pp. 261–270 (2004)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Linear Time Distributed Swap Edge Algorithms;Lecture Notes in Computer Science;2013

2. Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree;Algorithmica;2012-07-20

3. Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree;Mathematical Foundations of Computer Science 2010;2010

4. Computing Best Swaps in Optimal Tree Spanners;Algorithms and Computation;2008