On the on-line weighted k-taxi problem

Authors:
Weimin Ma;Ke Wang
Affiliations:
School of Economics and Management, Beijing University of Aeronautics and Astronautics, Beijing and School of Economics and Management, Xi'an Technological University, Xi'an, P. R. China;School of Economics and Management, Beijing University of Aeronautics and Astronautics, Beijing, P.R. China
Venue:
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Year:
2007

Citing 7
Cited 0

Amortized efficiency of list update and paging rules

Communications of the ACM
Competitive algorithms for server problems

Journal of Algorithms
Competitive algorithms for the weighted server problem

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
More on Weighted Servers or FIFO is Better than LRU

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
The CNN Problem and Other k-Server Variants

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
The weighted 2-server problem

Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
On the on-line k-truck problem with benefit maximization

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on some results of k-server problem and k-taxi problem, the on-line weighted k-taxi problem is originally proposed and studied by our team. In the weighted k-taxi problem, the cost of every taxi on the same distance is different whereas that is same in the traditional k-taxi problem. In this paper, the formulation of the on-line weighted k-taxi problem is presented first. Following that, some preliminary results which used to get the main theorems are given. Thirdly, some online algorithms are designed to address the problem and the competitive analysis are given in detail. Furthermore, the lower bound of competitive ratio for some special cases is obtained. Finally, some conclusions are made and some future research directions are pointed out.