TU Berlin

Prof. Dr. Martin SkutellaVeröffentlichungen

Inhalt des Dokuments

zur Navigation

Publikationen

S

Schulz, Andreas S. and Skutella, Martin.
Scheduling-LPs bear probabilities: Randomized approximations for min-sum criteria.
In Burkard, Rainer and Woeginger, Gerhard J., eds. Algorithms – ESA '97, Lecture Notes in Computer Science, 1284: 416–429. Springer, 1997.

Link zur Publikation

Schulz, Andreas S. and Skutella, Martin.
Random-based scheduling: New approximations and LP lower bounds.
In Rolim, José D. P., eds. Randomization and Approximation Techniques in Computer Science, Lecture Notes in Computer Science, 1269: 119–133. Springer, 1997.

Link zur Publikation

Schulz, Andreas S. and Skutella, Martin.
Scheduling Unrelated Machines by Randomized Rounding.
SIAM Journal on Discrete Mathematics, 15: 450–469, 2002.

Link zur Publikation

Schulz, Andreas S. and Skutella, Martin.
The Power of α-Points in Preemptive Single Machine Scheduling.
Journal of Scheduling, 5: 121–133, 2002.

Link zur Publikation

Sering, Leon and Skutella, Martin.
Multi-Source Multi-Sink Nash Flows Over Time.
In Borndörfer, R. and Storandt, S., eds. Proceedings of the 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018), OASICS, 65:  12:1-12:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.

Link zur Originalpublikation


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.


Skutella, Martin and Sviridenko, Maxim and Uetz, Marc.
Stochastic scheduling on unrelated machines.
In Mayr, E. W. and Portier, N., eds. Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science, Leibniz International Proceedings in Informatics, 25:  639-650. Dagstuhl Publishing, 2014.


Skutella, Martin and Peis, Britta and Wiese, Andreas.
Packet Routing on the Grid.
In Lopez-Ortiz, Alejandro, eds. Theoretical Informatics, 9th Latin American Symposium, LATIn 2010, Oaxaca, Mexico, Lecture Notes in Computer Science, Springer, 6034:  120-130. , 2010.


Skutella, Martin.
Algorithms and Linear Programming Relaxations for Scheduling Unrelated Parallel Machines.
In Bonifaci, Vincenzo and Demetrescu, Camil and Marchetti-Spaccamela, Alberto, eds. Experimental Algorithms – 12th International Symposium, SEA 2013, Lecture Notes in Computer Science, 7933: 1–3. Springer, 2013.


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.


Skutella, Martin.
Convex Quadratic Programming in Scheduling.
In Schulz, Aandreas S. and Skutella, Martin and Stiller, Sebastian and Wagner, Dorothea, eds. Gems of Combinatorial Optimization and Graph Algorithms,  125–132. Springer, 2015.


Skutella, Katharina and Skutella, Martin.
Minimal aufspannende Bäume – Wenn das Naheliegende das Beste ist....
In Vöcking, Berthold and Alt, Helmut and Dietzfelbinger, Martin and Reischuk, Karl Rüdiger and Scheideler, Christian and Vollmer, Heribert and Wagner, Dorothea, eds. Taschenbuch der Algorithmen,  353–360. Springer, 2008. In German.

Link zur Publikation

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.

Navigation

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe