Journal of the ACM Bibliography
F. K.
Hwang. An O(n log n) algorithm for
rectilinear minimal spanning trees. Journal of the ACM,
26(2):177-182, April 1979.
[BibTeX entry]
Selected papers that cite this one
- Moses Charikar, Dan Halperin, and Rajeev Motwani. The dynamic servers
problem. In Proceedings of the Ninth Annual ACM-SIAM Symposium
on Discrete Algorithms, pages 410-419, San Francisco, California,
25-27 January 1998.
- Y. H. Tsin and C.-A. Wang. Geodesic Voronoi
Diagrams in the Presence of Rectilinear Barriers Nordic Journal
of Computing, 3(1):1-26, Spring 1996.
- G. Y. Yan, A. Albrecht, G. H. F. Young, and C. K. Wong. The Steiner tree problem
in orientation metrics. Journal of Computer and System
Sciences, 55(3):529-546, December 1997.
Shortcuts: