Information Technology Reference
In-Depth Information
8. Crescenzi, P.: A short guide to approximation preserving reductions. In: Proceed-
ings of the 12th Annual IEEE Conference on Computational Complexity, CCC
1997, pp. 262-273. IEEE Computer Society (1997)
9. Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks 1(3), 195-
207 (1971)
10. Helmert, M.: On the complexity of planning in transportation domains. In: Pro-
ceedings of ECP 2001, pp. 349-360 (2001)
11. Helmert, M., Mattmuller, R., Roger, G.: Approximation properties of planning
benchmarks. In: Proceedings of the 2006 Conference on ECAI 2006: 17th European
Conference on Artificial Intelligence, pp. 585-589. IOS Press (2006)
12. Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complex-
ity classes. Journal of Computer and System Sciences 43(3), 425-440 (1991)
13. Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery prob-
lems (part I). Journal fur Betriebswirtschaft 58(1), 21-51 (2008)
14. Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery prob-
lems (part II). Journal fur Betriebswirtschaft 58(2), 81-117 (2008)
