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

Focke, J., Megow, N. and Meißner, J.
Minimum Spanning Tree under Uncertainty in Theory and Experiments.
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 Philip N. Klein (ed.)Proceedings of the Symposium on Discrete Algorithms (SODA) 2017, pp. 994–1005, SIAM, 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.  [pdf]


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


Megow, N., Meißner, J. and Skutella, M.
Randomization Helps Computing a Minimum Spanning Tree Under Uncertainty.
In Bansal, Nikhil and Finocchi, Irene (ed.)Algorithms – ESA 2015, Lecture Notes in Computer Science, Vol. 9294, pp. 878-890, Springer, 2015.  [pdf]


Zusatzinformationen / Extras

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe