News from the online traveling repairman (vol 295, pg 279, 2003)

被引：4
|
作者：
Krumke, SO
de Paepe, WE
Poensgen, D
Stougie, L
机构：
[1] Tech Univ Eindhoven, Dept Technol Management, NL-5600 MB Eindhoven, Netherlands
[2] Univ Kaiserslautern, Dept Math, D-67653 Kaiserslautern, Germany
[3] Konrad Zuse Zentrum Informat Tech Berlin, Dept Optimizat, D-14195 Berlin, Germany
[4] Tech Univ Eindhoven, Dept Math, NL-5600 MB Eindhoven, Netherlands
[5] CWI, Ctr Math & Comp Sci, NL-1090 GB Amsterdam, Netherlands
来源：
THEORETICAL COMPUTER SCIENCE | 2006年 / 352卷 / 1-3期
关键词：
online algorithims; competitive analysis; traveling repairman; latency; dial-a-ride problem;
D O I：
10.1016/j.tcs.2005.11.036
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
This note identifies and Corrects an error in our paper "News from the Traveling Repairman", which appeared in S.O. Krumke et al. [News from the online traveling repairman, Theoret. Comput. Sci. 295 (1-3) (2003) 279-294]. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码：347 / 348
页数：2
相关论文
共 50 条
12345