Power-aware collective tree exploration

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3894 LNCS, Issue , 2006, Pages 341-351

  Dynia, Miroslaw ^a   Korzeniowski, Miroslaw ^a   Schindelhauer, Christian ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SCIENCE; ENERGY UTILIZATION; INFORMATION ANALYSIS; ONLINE SYSTEMS; TREES (MATHEMATICS);

BATTERY POWER; INFORMATION COLLECTION; ONLINE ALGORITHM; OPTIMAL ALGORITHM; POWER-AWARE;

MOBILE ROBOTS;

EID: 33745603715     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11682127_24     Document Type: Conference Paper

References (11)

1. Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press, New York, NY, USA (1998)
2. Fraigniaud, P., Gasieniec, L., Kowalski, D., Pelc, A.: Collective tree exploration. In: Proc. LATIN 2004. Volume 2976. (2004) 141-151
3. Rao, N., Kareti, S., Shi, W., Iyenagar, S.: Robot navigation in unknown terrains: Introductory survey of non-heuristic algorithms. Technical report (1993)
4. Bender, M., Fernández, A., Ron, D., Sahai, A., Vadhan, S.: The power of a pebble: exploring and mapping directed graphs. In: Proc. 30th Symp. Theory of Computing, ACM (1998) 269-278
5. Awerbuch, B., Betke, M., Rivest, R., Singh, M.: Piecemeal graph exploration by a mobile robot. Information and Computation 152(2) (1999) 155-172
6. Dessmark, A., Pelc, A.: Optimal graph exploration without good maps. In: Proc. ESA 2002. Volume 2461. (2002) 374
7. Panaite, P., Pelc, A.: Exploring unknown undirected graphs. In: SODA '98: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, Society for Industrial and Applied Mathematics (1998) 316-322
8. Bender, M., Slonim, D.: The power of team exploration: two robots can learn unlabeleddirected graphs. In: Proc. FOCS 1994. (1994) 75-85
9. Averbakh, I., Berman, O.: (p - l)/(p + l)-approximate algorithms for p-traveling salesmen problems on a tree with minmax objective. Discrete Applied Mathematics 75(3) (1997) 201-216
10. Nagamochi, H., Okada, K.: A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree. Discrete Applied Mathematics 140(1-3) (2004) 103-114
11. Averbakh, I., Berman, O.: A heuristic with worst-case analysis for minimax routing of two traveling salesmen on a tree. Discrete Applied Mathematics 68 (1996) 17-32