E. Kranakis and A. Spatharis. Almost optimal on-line search in unknown streets. In Proc. 9th Canad. Conf. Comput. Geom., pages 93--99, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
On the Competitive Complexity of Navigation Tasks - Icking, Kamphans, Klein.. (2002) (Correct)
....on search strategies for improving the upper bound of 5.72 toward the # 2 lower bound, see Icking [21] 4.44, Kleinberg [28] 2.61, Lopez Ortiz and Schuierer [31] 2.05, Lopez Ortiz and Schuierer [33] 1.73, Semrau [41] 1.57, Icking et al. 24] 1. 51, Dasgupta et al. 10] Kranakis and Spatharis [29], Lopez Ortiz and Schuierer [34] The gap between the upper and lower bound, also mentioned in Mitchell [37] was finally closed by Icking et al. 22] and independently by Semrau and Schuierer [40] A java implementation of this strategy is available at ....
E. Kranakis and A. Spatharis. Almost optimal on-line search in unknown streets. In Proc. 9th Canad. Conf. Comput. Geom., pages 93--99, 1997.
An Optimal Competitive Strategy for Walking in Streets - Icking, Klein, Langetepe (1999) (1 citation) (Correct)
....bound was lowered to 4.44 in Icking [11] then to 2.61 in Kleinberg [15] to 2.05 in Lopez Ortiz and Schuierer [17] to 1.73 in Lopez Ortiz and Schuierer [19] to 1.57 in Semrau [23] and to 1. 51 in Icking et al. 12] Further attempts were made by Dasgupta et al. 7] and by Kranakis and Spatharis [16]. But it has remained open, until now, if # 2 is really the largest lower bound, and how to design an optimal strategy for searching the target in a street; compare the open problems mentioned in Mitchell [20] In this paper both questions are finally answered. We introduce a new strategy and ....
E. Kranakis and A. Spatharis. Almost optimal on-line search in unknown streets. In Proc. 9th Canad. Conf. Comput. Geom., pages 93--99, 1997.
The Exact Cost of Exploring Streets with CAB - Lopez-Ortiz, Schuierer (Correct)
.... 5:71) The upper bound on the competitive factor was later improved by Icking to 1 =2 p 1 2 =4 ( 4:44) 11] A number of other strategies have been presented since by Kleinberg [16] L opez Ortiz and Schuierer [19, 20, 21] Semrau [26] Dasgupta et al. 6] and Kranakis and Spatharis [17]. Unfortunately, the analyses of the last two results turned out to be erroneous. The currently best known competitive ratio is 1:51 [12] Due to the simple lower bound example shown in Figure 1 there is no strategy with a competitive ratio less than p 2 [15] If a strategy moves to the left or ....
E. Kranakis and A. Spatharis. Almost optimal on--line search in unknown streets. In Proc. 9th Canadian Conference on Computational Geometry, pages 93--99, 1997.
The Exact Cost of Exploring Streets with a CAB (Extended .. - A. López-Ortiz.. (Correct)
.... an upper bound on its competitive ratio of 1 3=2p( 5:71) later improved by Icking to 1 p=2 p 1 p 2 =4 ( 4:44) 6] A number of other strategies have been presented since by Kleinberg [10] Lopez Ortiz and Schuierer [13, 14, 15] Semrau [18] Dasgupta et al. 3] and Kranakis and Spatharis [11]. Unfortunately, the analyses of the last two results turned out to be erroneous. The currently best known competitive ratio is 1:51 [7] It is well known that there is no strategy with a competitive ratio less than p 2 [9] In this paper we present the first exact analysis of the strategy ....
E. Kranakis and A. Spatharis. Almost optimal on--line search in unknown streets. In Proc. 9th CCCG, pp. 93--99, 1997.
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