摘要
应用复位策略给出了局内ｋ出租车调度问题的竞争算法．
Competitive algorithms are given for on line scheduling of k taxi problem using the position maintaining occupied strategy. Competitive algorthms with competitive ratio 2 for k=n and k=n 1 are presented.
出处
《西安交通大学学报》
EI
CAS
CSCD
北大核心
1997年第S1期58-63,共6页
Journal of Xi'an Jiaotong University
基金
西安交通大学科研基金
关键词
局内问题
竞争算法
竞争比
on line problem competitive algorithm competitive ratio
