An Improved Lower Bound on the Competitive Ratio of Deterministic Online Algorithms for the Multi-agent K-Canadian Traveler Problem

An Improved Lower Bound on the Competitive Ratio of Deterministic Online Algorithms for the Multi-agent K-Canadian Traveler Problem

We present an improved lower bound on the competitive ratio of deterministic online algorithms for the multi-agent *k*-Canadian Traveler Problem.

Saved in:
Bibliographic Details
Main Authors: Davood Shiri, F. Sibel Salman
Format: Article
Language:English
Published: Findings Press 2022-08-01
Series:Findings
Online Access:https://doi.org/10.32866/001c.37217
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present an improved lower bound on the competitive ratio of deterministic online algorithms for the multi-agent *k*-Canadian Traveler Problem.
ISSN:2652-8800

Similar Items