Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen  Home/Search
Context Related
| cs.ust.hk/~rudolf/...searchratio_esa.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.ust.hk/~rudolf/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: How e#ciently can we search an unknown environment for a goal in unknown position? How much would it help if the environment were known? We answer these questions for simple polygons and for general graphs, by providing online search strategies that are as good as the best o#ine search algorithms, up to a constant factor. For other settings we prove that no such online algorithms exist. (Update)
Cited by: More
Competitive Online Searching for a Ray in the Plane - Andrea Eubeler Rudolf (Correct)
Optimal Competitive Online Ray Search with an Error-Prone Robot - Tom Kamphans And (2005) (Correct)
Active bibliography (related documents): More All
0.5: Competitive Search Ratio of Graphs and Polygons - Fleischer, Kamphans, Klein.. (2004) (Correct)
0.5: Exploring Grid Polygons Online - Icking, Kamphans, Klein, Langetepe (2005) (Correct)
0.5: Optimal Robot Localization in Trees - Fleischer, Romanik, Schuierer.. (2002) (Correct)
Similar documents based on text: More All
0.4: Smallest Color-Spanning Objects - Abellanas, Hurtado Diaz, Icking.. (2001) (Correct)
0.3: Generalized Self-Approaching Curves - Aichholzer, Aurenhammer, Icking.. (1998) (Correct)
0.2: Exploring an Unknown Cellular Environment - Icking, Kamphans, Klein, Langetepe (2000) (Correct)
Related documents from co-citation: More All
2: Geometric shortest paths and network optimization - Mitchell - 1998
2: the competitive complexity of navigation tasks - Icking, Kamphans et al. - 2002
2: line searching and navigation (context) - Berman - 1998
BibTeX entry: (Update)
R. Fleischer, T. Kamphans, R. Klein, E. Langetepe, and G. Trippen. Competitive online approximation of the optimal search ratio. In Proc. 12th Annu. European Sympos. Algorithms,volume3221ofLecture Notes Comput. Sci., pages 335--346, Heidelberg, 2004. Springer-Verlag. http://citeseer.ist.psu.edu/article/fleischer04competitive.html More
@misc{ fleischer04competitive,
author = "R. Fleischer and T. Kamphans and R. Klein and E. Langetepe and G. Trippen",
title = "Competitive online approximation of the optimal search ratio",
text = "R. Fleischer, T. Kamphans, R. Klein, E. Langetepe, and G. Trippen. Competitive
online approximation of the optimal search ratio. In Proc. 12th Annu. European
Sympos. Algorithms,volume3221ofLecture Notes Comput. Sci., pages 335--346,
Heidelberg, 2004. Springer-Verlag.",
year = "2004",
url = "citeseer.ist.psu.edu/article/fleischer04competitive.html" }
Citations (may not include all citations):65 Exploring an unknown graph (context) - Deng, Papadimitriou - 1999
46 How to learn an unknown environment I: The rectilinear case - Deng, Kameda et al. - 1998
24 Shortest watchman routes in simple polygons (context) - Chin, Ntafos - 1991
19 line searching and navigation (context) - Berman - 1998
16 Algorithmische Geometrie (context) - Klein - 1997
14 An incremental algorithm for constructing shortest watchman .. (context) - Tan, Hirata et al. - 1993
14 an incremental algorithm for constructing shortest watchman .. (context) - Tan, Hirata et al. - 1999
14 Searching a fixed graph (context) - Koutsoupias, Papadimitriou et al. - 1996
13 Exploring unknown environments with obstacles - Albers, Kursawe et al. - 1999
12 Searching in the plane (context) - Baeza-Yates, Culberson et al. - 1993
9 An optimal competitive strategy for walking in streets - Icking, Klein et al. - 1999
9 Optimal constrained graph exploration - Duncan, Kobourov et al. - 2001
6 Kluwer Academic Publications (context) - Alpern, Gal et al. - 2002
4 Optimal robot localization in trees - Fleischer, Romanik et al. - 2001
4 An optimal strategy for searching in unknown streets (context) - Schuierer, Semrau - 1999
3 The polygon exploration problem - Ho, Christian et al. - 2001
1 Touring a sequence of polygons - Dror, Efrat et al. - 2003
1 line searching in simple polygons - Schuierer - 1997
Documents on the same site (http://www.cs.ust.hk/~rudolf/): More
Tight Bounds on Maximal and Maximum Matchings - Biedl, Demaine, Duncan.. (Correct)
Solitaire Clobber - Demaine, Demaine, Fleischer (Correct)
Optimal Robot Localization in Trees - Fleischer, Romanik, Schuierer.. (2002) (Correct)
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