BESPAMYATHNIKH, S. N., AND SEGAL, M. Rectilinear static and dynamic discrete 2-center problems. In Proc. 6th Workshop Algorithms Data Struct. (1999), vol. 1663 of Lecture Notes Comput. Sci., SpringerVerlag, pp. 276--287. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Rectilinear 2-Center Problems - Bespamyatnikh, Kirkpatrick (1999) (5 citations) Self-citation (Bespamyatnikh) (Correct)
....in higher dimensions) of minimum size, where the square centers are constrained to F . The discrete 2 center problem in the Euclidean plane appears to be more difficult than the standard 2 center problem. Agarwal et al. 2] presents O(n 4=3 log 5 n) algorithm for the case S = F . Very recently [17, 3] the discrete 2 center problem had been studied under rectilinear metric. Katz et al. 17] gave O(n log 2 n) algorithm for the case S = F . Bespamyatnikh and Segal [3] improved the running time to O( n m) log(n m) using an O(n m) decision algorithm. In this paper we focus on the 2 center ....
....the standard 2 center problem. Agarwal et al. 2] presents O(n 4=3 log 5 n) algorithm for the case S = F . Very recently [17, 3] the discrete 2 center problem had been studied under rectilinear metric. Katz et al. 17] gave O(n log 2 n) algorithm for the case S = F . Bespamyatnikh and Segal [3] improved the running time to O( n m) log(n m) using an O(n m) decision algorithm. In this paper we focus on the 2 center problems, both continuous and discrete, in higher dimensions under the rectilinear metric L1 . We give a simple linear time algorithm for the rectilinear 2 center ....
[Article contains additional citation context not shown here]
S. Bespamyatnikh and M. Segal. Rectilinear static and dynamic discrete 2-center problems. In to appear in Proc. 9th Workshop Algorithms Data Struct., 1999.
A Simple Linear Algorithm for Computing Rectilinear - Hoffmann (Correct)
No context found.
BESPAMYATHNIKH, S. N., AND SEGAL, M. Rectilinear static and dynamic discrete 2-center problems. In Proc. 6th Workshop Algorithms Data Struct. (1999), vol. 1663 of Lecture Notes Comput. Sci., SpringerVerlag, pp. 276--287.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC