Advanced Search
Now showing items 1-2 of 2
A QPTAS for the general scheduling problem with identical release dates
(Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017)
Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs
(Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018)