Tsubasa Harada

activity

20222026

most citedCompetitive Analysis of Online Facility Assignment for General Layout of Servers on a Line

1 citations · 1 across the 6 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

cs.DS2024

A Nearly Optimal Deterministic Algorithm for Online Transportation Problem

Tsubasa Harada, Toshiya Itoh

For the online transportation problem with $m$ server sites, it has long been known that the competitive ratio of any deterministic algorithm is at least $2 m - 1$ . Kalyanasundaram an…

cs.DS2024

A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line

Tsubasa Harada

In the online facility assignment on a line (OFAL) with a set $S$ of $k$ servers and a capacity $c : S \to N$ , each server $s \in S$ with a capacity $c (s)$ is placed on a line…