On-line steiner trees in the Euclidean plane
Open Access
- 1 July 1993
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 10 (2) , 113-121
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Constructing Reliable Communication Networks of Small Weight OnlineJournal of Algorithms, 1995
- A travelling salesman problem in the k-dimensional unit cubeOperations Research Letters, 1992
- Dynamic Steiner Tree ProblemSIAM Journal on Discrete Mathematics, 1991
- A geometric problem involving the nearest neighbour algorithmOperations Research Letters, 1987
- Steiner problem in networks: A surveyNetworks, 1987
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985
- An Analysis of Several Heuristics for the Traveling Salesman ProblemSIAM Journal on Computing, 1977
- Probabilistic computations: Toward a unified measure of complexity1977