direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Hinweis zum Copyright

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Publikationen

Dürr, C., Erlebach, T., Megow, N. and Meißner, J.
An Adversarial Model for Scheduling with Testing.
In Proceedings of Innovations in Theoretical Computer Science (ITCS), 2018.
full version on arXiv with title "Scheduling with Explorable Uncertainty".  [pdf]


Focke, J., Megow, N. and Meißner, J.
Minimum Spanning Tree under Uncertainty in Theory and Experiments.
In Proceedings of the Symposium on Experimental Algorithms (SEA), 2017.  [pdf]


Bjelde, A., Disser, Y., Hackfeld, J., Hansknecht, C., Lipmann, M., Meißner, J., Schewior, K., Schlöter, M. and Stougie, L.
Tight bounds for online TSP on the line.
In Proceedings of the Symposium on Discrete Algorithms (SODA), pp. 994–1005, 2017.  [pdf]


Antoniadis, A., Hoeksma, R., Meißner, J., Verschae, J. and Wiese, A.
A QPTAS for the General Scheduling Problem with Identical Release Dates.
In Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP), 2017.  [pdf]


Abed, F., Chen, L., Disser, Y., Groß, M., Megow, N., Meißner, J., Richter, A. and Rischke, R.
Scheduling Maintenance Jobs in Networks.
In Proceedings of the International Conference on Algorithms and Complexity (CIAC), 2017.
full version on arXiv.  [pdf]


Megow, N., Meißner, J. and Skutella, M.
Randomization Helps Computing a Minimum Spanning Tree under Uncertainty.
SIAM Journal on Computing, pp. 1217 - 1240, 2017.  [pdf]


Megow, N., Meißner, J. and Skutella, M.
Randomization Helps Computing a Minimum Spanning Tree Under Uncertainty.
In Proceedings of the European Symposium on Algorithms (ESA), 2015.  [pdf]


Zusatzinformationen / Extras

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe