TU Berlin

Prof. Dr. Martin Skutella Publications

Page Content

to Navigation



Hoogeveen, Han and Skutella, Martin and Woeginger, Gerhard J..
Preemptive scheduling with rejection.
Mathematical Programming, 94: 361–374, 2003.

Link to publication

Skutella, Martin.
Approximating the single source unsplittable min-cost flow problem.
Mathematical Programming, 91: 493–514, 2002.

Link to publication

Skutella, Martin and Weber, Alexia.
On the dominant of the s-t-cut polytope.
Mathematical Programming, 124: 441–454, 2010.

Link to publication

Baumann, Nadine and Skutella, Martin.
Solving Evacuation Problems Efficiently: Earliest Arrival Flows with Multiple Sources.
Mathematics of Operations Research, 34: 499–512, 2009.

Link to publication

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

Sanders, Peter and Sivadasan, Naveen and Skutella, Martin.
Online Scheduling with Bounded Migration.
Mathematics of Operations Research, 34: 481–498, 2009.

Link to publication

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.
Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem.
Mathematics of Operations Research, 23: 909–929, 1998.

Link to publication

Skutella, Martin and Woeginger, Gerhard J..
A PTAS for minimizing the total weighted completion time on identical parallel machines.
Mathematics of Operations Research, 25: 63–75, 2000.

Link to publication

Matusche, Jannik and Skutella, Martin, and Soto, José.
Robust randomized matchings.
Mathematics of Operations Research, 43: 675-692, 2018.


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.

Groß, Martin and Pfetsch, Marc E. and Schewe, Lars and Schmidt, Martin and Skutella, Martin.
Algorithmic results for potential-based flows: Easy and hard cases.
Networks, 73: 306–324, 2019.

Martens, Maren and Skutella, Martin.
Flows on Few Paths: Algorithms and Lower Bounds.
Networks, 48: 68–76, 2006.

Link to publication


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 to original publication

Althaus, Ernst and Funke, Stefan and Har-Peled, Sariel and Könemann, Jochen and Ramos, Edgar A. and Skutella, Martin.
Approximating k-Hop Minimum-Spanning Trees.
Operations Research Letters, 33: 115–120, 2005.

Link to publication

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.

Grandoni, Fabrizio and Kaibel, Volker and Oriolo, Gianpaolo and Skutella, Martin.
A short proof of the VPN tree routing conjecture on ring networks.
Operations Research Letters, 36: 361–365, 2008.

Link to publication

Salazar, Fernanda and Skutella, Martin.
Single-source k-splittable min-cost flows.
Operations Research Letters, 37: 71–74, 2009.

Link to publication

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.


Quick Access

Schnellnavigation zur Seite über Nummerneingabe