@inproceedings{d56103d2a8d9415c94ba55643b0e2ec9,
title = "New results on the k-truck problem",
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).",
author = "Weimin Ma and Yinfeng Xu and Jane You and James Liu and Kanliang Wang",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 8th Annual International Conference on Computing and Combinatorics, COCOON 2002 ; Conference date: 15-08-2002 Through 17-08-2002",
year = "2002",
doi = "10.1007/3-540-45655-4\_54",
language = "英语",
isbn = "354043996X",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "504--513",
editor = "Ibarra, \{Oscar H.\} and Louxin Zhang",
booktitle = "Computing and Combinatorics - 8th Annual International Conference, COCOON 2002, Proceedings",
}