On-line steiner trees in the Euclidean plane-Reference-Cited by-同舟云学术

On-line steiner trees in the Euclidean plane

Published:1993-08 Issue:2 Volume:10 Page:113-121
ISSN:0179-5376
Container-title:Discrete & Computational Geometry
language:en
Short-container-title:Discrete Comput Geom

Author:

Alon Noga,Azar Yossi

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science

Link

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

Reference11 articles.

1. [BM] B. Bollobás and A. Meir, A traveling salesman problem in thek-dimensional unit cube,Oper. Res. Lett. 11 (1992), 19–21.

2. [BS] J. L. Bentley and J. B. Saxe, An analysis of two heuristics for the Euclidean traveling salesman,Proceedings of the 18th Annual Allerton Conference on Communication, Control and Computing, Monticello, 1980, pp. 41–49.

3. [CV] B. Chandra and S. Vishwanathan, Constructing reliable communication networks of small weight on-line, Manuscript.

4. [GJ] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.

5. [IW] M. Imase and B. M. Waxman, Dynamic Steiner tree problem,SIAM J. Discrete Math. 4 (1991), 369–384.

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

1. Online Euclidean Spanners;ACM Transactions on Algorithms;2024-08-08

2. Online Spanners in Metric Spaces;SIAM Journal on Discrete Mathematics;2024-03-12

3. Steiner Tree Problems;Encyclopedia of Optimization;2024

4. Non-Greedy Online Steiner Trees on Outerplanar Graphs;Algorithmica;2020-10-16

5. Parameterized Analysis of the Online Priority and Node-Weighted Steiner Tree Problems;Theory of Computing Systems;2019-04-15