direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publikationen

2017

Schlöter, Miriam and Skutella, Martin.
Fast and Memory-Efficient Algorithms for Evacuation Problems.
In Klein, Philip N., eds. Proceedings of the 28th Annual ACM–SIAM Symposium on Discrete Algorithms,  821-840. SIAM, 2017.


Matuschke, Jannik and McCormick, S. Thomas and Oriolo, Gianpaolo and Peis, Britta and Skutella, Martin.
Protection of flows under targeted attacks.
Operations Research Letters, 45: 53-59, 2017.


Megow, Nicole and Meißner, Julie and Skutella, Martin.
Randomization Helps Computing a Minimum Spanning Tree under Uncertainty.
accepted to SIAM Journal on Computing, 2017.

Link zur Publikation

2016


Megow, Nicole and Skutella, Martin and Verschae, José and Wiese, Andreas.
The Power of Recourse for Online MST and TSP.
SIAM Journal on Computing, 45: 859-880, 2016.


Borndörfer, Ralf and Schenker, Sebastian and Skutella, Martin and Strunk, Timo.
PolySCIP.
In Greuel, Gert-Martin and Koch, Thorsten and Paule, Peter and Sommese, Aandrew J., eds. Proceedings of the 5th International Conference on Mathematical Software, Lecture Notes in Computer Science, 9725:  259–264. Springer, 2016.


Skutella, Martin.
A note on the ring loading problem.
SIAM Journal on Discrete Mathematics, 30: 327–342, 2016.


Skutella, Martin and Sviridenko, Maxim and Uetz, Marc.
Unrelated Machine Scheduling with Stochastic Processing Times.
Mathematics of Operations Research, 41: 851–864, 2016.


Skutella, Martin and Verschae, José.
Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures.
Mathematics of Operations Research, 41: 991–1021, 2016.


2015

Groß, Martin and Skutella, Martin.
A tight bound on the speed-up through storage for quickest multi-commodity flows.
Operation Research Letters, 43: 93–95, 2015.

Link zur Originalpublikation

Arulselvan, Ashwin and Groß, Martin and Skutella, Martin.
Graph Orientation and Flows Over Time.
Networks, 66: 196-209, 2015.


Arulselvan, Ashwin and Maurer, Olaf and Skutella, Martin.
An incremental algorithm for the uncapacitated facility location problem.
Networks, 65: 306-311, 2015.


Megow, Nicole and Meißner, Julie and Skutella, Martin.
Randomization Helps Computing a Minimum Spanning Tree Under Uncertainty.
In Bansal, Nikhil and Finocchi, Irene, eds. Algorithms – ESA 2015, Lecture Notes in Computer Science, 9294:  878-890. Springer, 2015.

Link zur Publikation

Skutella, Martin.
A note on the ring loading problem.
Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015) 37-46, 2015.


Disser, Yann and Skutella, Martin.
The Simplex Algorithm is NP-mighty.
In Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA),  858-872. , 2015.

Link zur Publikation (PDF, 493,0 KB)

Copyright notice

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.

Zusatzinformationen / Extras

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe