Abstract
We present an improved lower bound on the competitive ratio of deterministic online algorithms for the multi-agent k-Canadian Traveler Problem.
Publisher
Network Design Lab - Transport Findings
Reference11 articles.
1. Weighted online minimum latency problem with edge uncertainty;Vahid Akbari;European Journal of Operational Research,2021
2. An online optimization approach to post-disaster road restoration;Vahid Akbari;Transportation Research Part B: Methodological,2021
3. An online optimization approach for post-disaster relief distribution with online blocked edges;Vahid Akbari;Computers & Operations Research,2022
4. Amortized efficiency of list update rules;Daniel Dominic Sleator;Proceedings of the sixteenth annual ACM symposium on Theory of computing - STOC '84,1984
5. Online Optimization of First-responder Routes in Disaster Response Logistics;Davood Shiri;IBM Journal of Research and Development,2020