Abstract
AbstractGerhard Woeginger has passed away. His colleagues Jan Karel Lenstra, Franz Rendl, Frits Spieksma and Marc Uetz commemorate a great scientist and dear friend.
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference17 articles.
1. Alon, N., Azar, Y., Woeginger, G. J., & Yadid, T. (1998). Approximation schemes for scheduling on parallel machines. Journal of Scheduling, 1, 55–66.
2. Burkard, R. E., Deineko, V. G., van Dal, R., van der Veen, J. A. A., & Woeginger, G. J. (1998). Well-solvable special cases of the traveling salesman problem: A survey. SIAM Review, 40, 496–546.
3. Csirik, J., & Woeginger, G. J. (1998). On-line packing and covering problems. In A. Fiat & G. J. Woeginger (Eds.), Online algorithms: The state of the art; LNCS 1442 (pp. 147–177). Springer.
4. Duijvestijn, A. J. W. (1962). Electronic computation of squared rectangles. PhD thesis, Technische Hogeschool Eindhoven.
5. Hoogeveen, H., Schuurman, P., & Woeginger, G. J. (2001). Non-approximability results for scheduling problems with minsum criteria. INFORMS Journal on Computing, 13, 157–168.