Sciweavers

Share
DAGSTUHL
2000

On the Competitive Complexity of Navigation Tasks

9 years 3 months ago
On the Competitive Complexity of Navigation Tasks
A strategy S solving a navigation task T is called competitive with ratio r if the cost of solving any instance t of T does not exceed r times the cost of solving t optimally. The competitive complexity of task T is the smallest possible value r any strategy S can achieve. We discuss this notion, and survey some tasks whose competitive complexities are known. Then we report on new results and ongoing work on the competitive complexity of exploring an unknown cellular environment.
Christian Icking, Thomas Kamphans, Rolf Klein, Elm
Added 01 Nov 2010
Updated 01 Nov 2010
Type Conference
Year 2000
Where DAGSTUHL
Authors Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe
Comments (0)
books