Author:
Althöfer Ingo,Das Gautam,Dobkin David,Joseph Deborah
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Althöfer: On Optimal Realizations of Finite Metric Spaces by Graphs: Discrete and Computational Geometry 3, 1988, 103–122.
2. Awerbuch: Complexity of Network Synchronization: JACM, 1985, 804–823.
3. Awerbuch, Bar-Noy, Linial, Peleg: Compact Distributed Data Structures for Adaptive Routing: STOC, 1989, 479–489.
4. Althöfer, Das, Dobkin, Joseph: Generating Sparse Spanners for Weighted Graphs: submitted to Discrete and Computational Geometry.
5. Awerbuch, Peleg: Routing with Polynomial Communication-Space Tradeoff: Manuscript, 1989.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Having Hope in Hops: New Spanners, Preservers and Lower Bounds for Hopsets;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
2. On Additive Spanners in Weighted Graphs with Local Error;Graph-Theoretic Concepts in Computer Science;2021
3. Ramsey Spanning Trees and Their Applications;ACM Transactions on Algorithms;2020-04-27
4. Weighted Additive Spanners;Graph-Theoretic Concepts in Computer Science;2020
5. Approximation Algorithms and an Integer Program for Multi-level Graph Spanners;Lecture Notes in Computer Science;2019