Comments on Bern's probabilistic results on rectilinear Steiner trees

View Related Documents

Journal Article
Two probabilistic results on rectilinear steiner trees
Marshall W. Bern
Algorithmica, 1988, Volume 3, Numbers 1-4, Pages 191-204
- Download PDF (812.4 KB)
Book Chapter
An approximation scheme for some Steiner tree problems in the plane
Tao Jiang and Lusheng Wang
Lecture Notes in Computer Science, 1994, Volume 834, Algorithms and Computation, Pages 414-422
- Download PDF (422.0 KB)
Journal Article
On better heuristics for Steiner minimum trees
Ding-Zhu Du and Yanjun Zhang
Mathematical Programming, 1992, Volume 57, Numbers 1-3, Pages 193-202
- Download PDF (518.8 KB)
Journal Article
Approximations and Lower Bounds for the Length of Minimal Euclidean Steiner Trees
J. H. Rubinstein, J. Weng and N. Wormald
Journal of Global Optimization, 2006, Volume 35, Number 4, Pages 573-592
- Download PDF (186.6 KB)
Book Chapter
Experimental Demonstration of Coherent Quantum Feedback
Richard J. Nelson, Yaakov Weinstein, Seth Lloyd and David G. Gory
2002, Quantum Communication, Computing, and Measurement 2, Part III, Pages 353-358
- Download PDF (130.2 KB)
Book Chapter
The Probabilistic Theory of the Joint Linear Complexity of Multisequences
Harald Niederreiter
Lecture Notes in Computer Science, 2006, Volume 4086, Sequences and Their Applications – SETA 2006, Pages 5-16
- Download PDF (223.2 KB)
Book Chapter
On nearest-neighbor graphs
Michael S. Paterson and F. Frances Yao
Lecture Notes in Computer Science, 1992, Volume 623, Automata, Languages and Programming, Pages 416-426
- Download PDF (536.6 KB)
Book Chapter
Two probabilistic results on merging
Wenceslas Fernandez de la Vega, Sampath Kannan and Miklos Santha
Lecture Notes in Computer Science, 1990, Volume 450, Algorithms, Pages 118-127
- Download PDF (656.2 KB)
Book Chapter
On the prefixes of a random trace and the membership problem for context-free trace languages
Alberto Bertoni and Massimiliano Goldwurm
Lecture Notes in Computer Science, 1989, Volume 356, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Pages 35-59
- Download PDF (1.5 MB)
Book Chapter
Other Probabilistic Results
Pierre Collet and Jean-Pierre Eckmann
Theoretical,Mathematical Physics, 2006, Concepts and Results in Chaotic Dynamics: A Short Course, Pages 163-185
- Download PDF (514.4 KB)

Abstract

It is shown that Bern's probabilistic asymptotic results on rectilinear Steiner trees remain valid for the model that there are exactlyN nodes uniformly distributed in a square of side √N.

Key words Rectilinear Steiner tree - Rectilinear spanning tree

Communicated by D. T. Lee.

Fulltext Preview

Image of the first page of the fulltext document

Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us

SpringerLink

Comments on Bern's probabilistic results on rectilinear Steiner trees

View Related Documents

Abstract

Fulltext Preview