Alborzi, H., E. Torng, P. Uthaisombut, and S. Wagner, “The k
-client problem,” J. Algorithms
(2), 115–173 (2001).CrossRef
Ascheuer, N., S. O. Krumke, and J. Rambau, “Online dial-a-ride problems: Minimizing the completion time,” in Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 1770, Springer-Verlag, 2000, pp. 639–650.
Augustine, J. and S. Seiden, “Linear time approximation schemes for vehicle routing,” in 8th Scandinavian Workshop on Algorithm Theory (in press).
Ausiello, G., E. Feuerstein, S. Leonardi, L. Stougie, and M. Talamo, “Algorithms for the on-line traveling salesman,” Algorithmica
(4), pp. 560–581 (2001).CrossRef
Awerbuch, B., Y. Azar, A. Blum, and S. Vempala, “New approximation guarantees for minimum-weight k-trees and prize-collecting salesmen,” SIAM J. Comput.
(1), 254–262 (1998).CrossRef
Bertsimas, D. and G. Van Ryzin, “A stochastic and dynamic vehicle routing problem in the Euclidean plane,” Oper. Res., 39(4), 601–615 (1991).
Bertsimas, D. and G. Van Ryzin, “Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles,” Oper. Res., 41(1), 60–76 (1993).
Deng, X. and C. Papadimitriou, “Exploring an unknown graph,” in Proceedings of 31st Annual Symposium on Foundations of Computer Science, 1990, pp. 355–361.
Feuerstein, E. and L. Stougie, “On-line single-server dial-a-ride problems.” Theor. Comput. Sci.
(1), 91–105 (2001).CrossRef
Hauptmeier, D., S. O. Krumke, and J. Rambau, “The online dial-a-ride problem under reasonable load”, in Proceedings of Algorithms and Complexity, 4th Italian Conference, Lecture Notes in Computer Science, Vol. 1767, Springer-Verlag, 2000, pp. 125–136.
Hauptmeier, D., S. O. Krumke, J. Rambau, and H. C. Wirth., “Euler is standing in line dial-a-ride problems with precedence-constraints,” Discrete Appl. Math.
(1), pp. 87–107 (2001).CrossRef
Jaillet, P., “A priori solution of a traveling salesman problem in which a random subset of the customers are visited.” Oper. Res.
(6), 929–936 (1988).CrossRef
Krumke, S. O., W. E. de Paepe, D. Poensgen, and L. Stougie, “News from the online traveling repairman,” in Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 2136, Springer-Verlag, 2001, pp. 487–499.
Manasse, M., L. A. McGeogh, and D. Sleator, “Competitive algorithms for server problems,” J. Algorithms
(2), 208–230 (1990).CrossRef
Powell, W., P. Jaillet, and A. Odoni, “Stochastic and dynamic networks and routing,” in M. Ball, T. Maganti, C. Monma, and G. Nemhauser (eds.), Network Routing, North-Holland, Amsterdam, 1995.
Psarafits, H., “Dynamic vehicle routing problems,” in B. L. Golden, and A. A. Assad (eds.), Vehicle Routing: Methods and Studies, North-Holland, Amsterdam, 1988.