In memoriam: Gerhard Woeginger (1964--2022) (Q2093179)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	In memoriam: Gerhard Woeginger (1964--2022)	scientific article

Statements

scholarly article

0 references

In memoriam: Gerhard Woeginger (1964--2022) (English)

0 references

Jan Karel Lenstra

0 references

0 references

Frits C. R. Spieksma

0 references

0 references

Journal of Scheduling

0 references

publication date

4 November 2022

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10951-022-00748-4

0 references

Approximation schemes for scheduling on parallel machines

0 references

Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey

0 references

Online algorithms. The state of the art

0 references

0 references

Non-Approximability Results for Scheduling Problems with Minsum Criteria

0 references

Preemptive scheduling with rejection

0 references

Integer Programming with a Fixed Number of Variables

0 references

Polynomial time approximation algorithms for machine scheduling: Ten open problems

0 references

A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines

0 references

A polynomial-time approximation scheme for maximizing the minimum machine completion time

0 references

When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

0 references

0 references

An axiomatic characterization of the Hirsch-index

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s10951-022-00748-4

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2093179

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2093179&oldid=37452961"