New Results on the k-Truck Problem

Authors:
Weimin Ma;Yinfeng Xu;Jane You;James Liu;Kanliang Wang
Affiliations:
-;-;-;-;-
Venue:
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Year:
2002

Citing 10
Cited 0

Amortized efficiency of list update and paging rules

Communications of the ACM
Data structures and network algorithms

Data structures and network algorithms
Competitive algorithms for on-line problems

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Competitive algorithms for server problems

Journal of Algorithms
On the power of randomization in online algorithms

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
An optimal on-line algorithm for K-servers on trees

SIAM Journal on Computing
New results on server problems

SIAM Journal on Discrete Mathematics
On the k-server conjecture

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On-line algorithms

ACM Computing Surveys (CSUR)
On-line k-Truck Problem and Its Competitive Algorithms

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, some results concerning the k-truck problem are produced. First, the algorithms and their complexity concerning the off-line k-truck problem are discussed. Following that, a lower bound of competitive ratio for the on-line k-truck problem is given. Based on the Position Maintaining Strategy (PMS), we get some new results which are slightly better than those of [1] for general cases. We also use the Partial-Greedy Algorithm (PG) to solve this problem on a special line. Finally, we extend the concepts of the on-line k-truck problem to obtain a new variant: Deeper On-line k-Truck Problem (DTP).