<link rel="stylesheet" href="styles.f3b1fba60ec7970c.css">

Publication:
An improved lower bound on the competitive ratio of deterministic online algorithms for the multi-agent k-Canadian Traveler Problem

Loading...
Thumbnail Image

Departments

Item type:Organizational Unit,

School / College / Institute

Item type:Organizational Unit,

Program

Organization Authors

Co-Authors

Shiri, Davood

Date

Language

Embargo Status

NO

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

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

Source

Publisher

Finding Press

Citation

item.page.haspartof

Source

Findings

item.page.ispartofseries

item.page.edition

DOI

10.32866/001c.37217

item.page.datauri

item.page.link

Rights

Copyrights Note

Endorsement

Review

Supplemented By

Referenced By

Related Patent

Related Goal

Google Scholar
Scholar'da Ara ↗
Altmetric
Dimensions
PlumX Metrikleri
BIP! Indicators