Two probabilistic results on rectilinear steiner trees-Reference-Cited by-同舟云学术

Two probabilistic results on rectilinear steiner trees

Published:1988-11 Issue:1-4 Volume:3 Page:191-204
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Bern Marshall W.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

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

Reference24 articles.

1. A. V. Aho, M. R. Garey, and F. K. Hwang, Rectilinear Steiner trees: efficient special case algorithms,Networks,7 (1977), 37–58.

2. M. W. Bern and M. de Carvalho. A greedy heuristic for the rectilinear Steiner tree problem, Technical Report UCB/CSD 87/306, University of California at Berkeley, 1986.

3. F. R. K. Chung and R. L. Graham, On Steiner trees for bounded point sets,Geom. Dedicata,11 (1981), 353–361.

4. F. R. K. Chung and F. K. Hwang, The largest minimal rectilinear Steiner trees for a set ofn points enclosed in a rectangle with given perimeter,Networks,9 (1979), 19–36.

5. M. R. Garey and D. S. Johnson, The rectilinear Steiner tree problem is NP-complete,SIAM J. Appl. Math.,32 (1977), 826–834.

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

1. Separating subadditive euclidean functionals;Random Structures & Algorithms;2016-12-22

2. Separating subadditive euclidean functionals;Proceedings of the forty-eighth annual ACM symposium on Theory of Computing;2016-06-19

3. Design of Modern Heuristics;Natural Computing Series;2011

4. On Optimal Solutions for the Optimal Communication Spanning Tree Problem;Operations Research;2009-04

5. Light orthogonal networks with constant geometric dilation;Journal of Discrete Algorithms;2009-03