In memoriam: Gerhard Woeginger (1964--2022)

DOI10.1007/s10951-022-00748-4zbMath1497.01022OpenAlexW4295193376MaRDI QIDQ2093179

Jan Karel Lenstra, Franz Rendl, Marc Uetz, Frits C. R. Spieksma

Publication date: 4 November 2022

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-022-00748-4

Mathematics Subject Classification ID

Biographies, obituaries, personalia, bibliographies (01A70)

Cites Work

• Unnamed Item
• Unnamed Item
• An axiomatic characterization of the Hirsch-index
• Online algorithms. The state of the art
• Approximation schemes for scheduling on parallel machines
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• Preemptive scheduling with rejection
• Polynomial time approximation algorithms for machine scheduling: Ten open problems
• A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
• Non-Approximability Results for Scheduling Problems with Minsum Criteria
• Integer Programming with a Fixed Number of Variables
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

This page was built for publication: In memoriam: Gerhard Woeginger (1964--2022)