On-line dial-a-ride problems under a restricted information model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2461, Issue , 2002, Pages 674-685

  Lipmann, Maarten ^a   Lu, X ^a,b   de Paepe, Willem E ^a   Sitters, Rene A ^a   Stougie, Leen ^a,c  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b EAST CHINA UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^c CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

SET THEORY; TOPOLOGY;

COMPLETE INFORMATION; DIAL-A-RIDE PROBLEM; END POINTS; INFORMATION MODELING; METRIC SPACES; PRACTICAL PROBLEMS; TWO-POINT;

INFORMATION SYSTEMS;

EID: 23044532262     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_59     Document Type: Conference Paper

References (5)

1. N. Ascheuer, S. O. Krumke, and J. Rambau, Online dial-a-ride problems: Minimizing the completion time, Proceedings of the 17th International Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 1770, Springer, Berlin, 2000, pp. 639–650. 675, 676, 684
2. G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, and M. Talamo, Algorithms for the on-line traveling salesman, Algorithmica 29 (2001), 560–581. 676, 677, 678, 681, 684
3. A. Borodin and R. El-Yaniv, Online computation and competitive analysis, Cambridge University Press, Cambridge, 1998. 675, 680
4. E. Feuerstein and L. Stougie, On-line single server dial-a-ride problems, Theoretical Computer Science 268(1) (2001), 91–105. 675, 684
5. A. Fiat and G. J. Woeginger (eds.), Online algorithms: The state of the art, Lecture Notes in Computer Science, vol. 1442, Springer, Berlin, 1998. 675