Author:
Awerbuch Baruch,Bartal Yair,Fiat Amos
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference17 articles.
1. N. Alon, Y. Azar, On-line Steiner trees in the Euclidean plane, in: Proceedings of the 8th ACM Symposium on Computational Geometry, 1992, pp. 337–343
2. B. Awerbuch, D. Peleg, On-line tracking of mobile users, Technical Memo TM-410, MIT, Lab. for Computer Science, August 1989
3. B. Awerbuch, D. Peleg, Sparse partitions, in: Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, 1990, pp. 503–513
4. B. Awerbuch, D. Peleg, Concurrent on-line tracking of mobile users, in: Proceedings of the Annual ACM SIGCOMM Symposium on Communication Architectures and Protocols, Zurich, Switzerland, September 1991
5. S. Ben-David, A. Borodin, R.M. Karp, G. Tardos, A. Wigderson, On the power of randomization in on-line algorithms, in: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990, pp. 379–386
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Non-Greedy Online Steiner Trees on Outerplanar Graphs;Algorithmica;2020-10-16
2. Dynamic Balanced Graph Partitioning;SIAM Journal on Discrete Mathematics;2020-01
3. The Mobile Server Problem;ACM Transactions on Parallel Computing;2019-12-05
4. Non-greedy Online Steiner Trees on Outerplanar Graphs;Approximation and Online Algorithms;2017
5. Online Balanced Repartitioning;Lecture Notes in Computer Science;2016