On-line network optimization problems-Reference-Cited by-同舟云学术

On-line network optimization problems

Published:1998 Issue: Volume: Page:268-280
ISSN:0302-9743
Container-title:Online Algorithms
language:
Short-container-title:

Author:

Kalyanasundaram Bala,Pruhs Kirk

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0029573

Reference24 articles.

1. N. Alon and Y. Azar. On-line Steiner trees in the Euclidean plane. Discrete and Computational Geometry, 10:113–121, 1993. Also in Proc. 8th ACM Symposium on Computational Geometry, 1992, pp. 337–343.

2. G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, and M. Talamo. Serving requests with online routing. In Proceedings of Scandinavian Workshop on Algorithm Theory, volume 824 of Lecture Notes in Computer Science, 1994.

3. G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, and M. Talamo. Competitive algorithms for the on-line traveling salesman problem. In Proceedings of International Workshop on Algorithms and Data Structures, volume 955 of Lecture Notes in Computer Science, 1995.

4. B. Awerbuch, Y. Azar, and Y. Bartal. On-line generalized Steiner problem. In Proc. of 7th ACM-SIAM Symposium on Discrete Algorithms, pages 68–74, 1996.

5. Y. Bartal, A. Fiat, and Y. Rabani. Competitive algorithms for distributed data management. In Proc. of the 24th Symposium on Theory of Computation, pages 39–48, 1992.

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

1. Mechanism Design for Mobility;Advanced Mathematical Science for Mobility Society;2024

2. Online Facility Assignment for General Layout of Servers on a Line;Combinatorial Optimization and Applications;2023-12-09

3. A randomized algorithm for online metric b-matching;Operations Research Letters;2023-11

4. Matching on the Line Admits no \(o(\sqrt {\log n})\) -Competitive Algorithm;ACM Transactions on Algorithms;2023-07-14

5. Online bottleneck matching on a line;Journal of Combinatorial Optimization;2023-05