Worst-case & average-case Efficiency trade-offs for search problems
Keyword(s):
Evacuation problems fall under the vast area of search theory and operations research. Problems of evacuation of two robots on a unit disc have been studied for an efficient evacuation time. Work done so far has focused on improving the ’worst-case’ evacuation time with deterministic algorithms. We study the ’average-case’ evacuation time (randomized algorithms) while considering the efficiency trade-off between worst-case and average-case costs. Our other contribution is to analyze average-case and worst-case costs for the cowpath problem (another search problem) which helped us to set a parallel method for the evacuation problem.
2005 ◽
Vol 15
(02)
◽
pp. 151-166
Keyword(s):
2019 ◽
Vol 2019
(2)
◽
pp. 166-186
Keyword(s):
Keyword(s):
1992 ◽
Vol 42
(3)
◽
pp. 145-149
◽
Keyword(s):
Keyword(s):
Keyword(s):