Abstract
We present an improved lower bound on the competitive ratio of deterministic online algorithms for the multi-agent k-Canadian Traveler Problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have