1 citations · 1 across the 3 of their papers we have counts for
3 papers
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 of servers and a capacity , each server with a capacity is placed on a line…
cs.DS2023★ 1 cited
Competitive Analysis of Online Facility Assignment for General Layout of Servers on a Line
Tsubasa Harada, Toshiya Itoh
In the online facility assignment on a line with a set of servers and a capacity , each server with a capacity is placed…
cs.DS2022
Capacity-Insensitive Algorithms for Online Facility Assignment Problems on a Line
Tsubasa Harada, Toshiya Itoh, Shuichi Miyazaki
In the online facility assignment problem OFA(k,\ell), there exist k servers with a capacity \ell \geq 1 on a metric space and a request arrives one-by-one. The task of an online a…