TU Berlin

Prof. Dr. Martin SkutellaVeröffentlichungen

Inhalt des Dokuments

zur Navigation

Publikationen

G

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.


Groß, Martin and Pfetsch, Marc E. and Skutella, Martin.
On the Complexity of Instationary Gas Flows.
Operations Research Letters, 46: 286-290, 2018.


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

Groß, Martin and Skutella, Martin.
Generalized Maximum Flows over Time.
In Persiano, P. and Solis-Oba, R., eds. Proceedings of the 9th Workshop on Approximation and Online Algorithms (WAOA), Lecture Notes in Computer Science, 7164:  247–260. Springer, 2012.


Groß, Martin and Skutella, Martin.
Maximum Multicommodity Flows over Time without Intermediate Storage.
In Epstein, Leah and Ferragina, Paolo, eds. Algorithms – ESA 2012, Lecture Notes in Computer Science, 7501: 539-550. Springer Berlin / Heidelberg, 2012.

Link zur Originalpublikation

Gröpl, Clemens and Skutella, Martin.
Parallel Repetition of MIP(2,1) Systems.
In Mayr, Ernst W. and Prömel, Hans Jürgen and Steger, Angelika, eds. Lectures on Proof Verification and Approximation Algorithms, Lecture Notes in Computer Science, 1367: 161–177. Springer, 1998.

Link zur Publikation

H

Hall, Alex and Hippler, Steffen and Skutella, Martin.
Multicommodity Flows Over Time: Efficient Algorithms and Complexity.
In Baeten, Jos C. M. and Lenstra, Jan Karel and Parrow, Joachim and Woeginger, Gerhard J., eds. Automata, Languages and Programming, Lecture Notes in Computer Science, 2719: 397–409. Springer, 2003.


Hall, Alex and Hippler, Steffen and Skutella, Martin.
Multicommodity Flows Over Time: Efficient Algorithms and Complexity.
Theoretical Computer Science, 379: 387–404, 2007.

Link zur Publikation

Hall, Alex and Langkau, Katharina and Skutella, Martin.
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times.
In Arora, Sanjeev and Jansen, Klaus and Rolim, José D. P. and Sahai, Amit, eds. Approximation, Randomization, and Combinatorial Optimization, Lecture Notes in Computer Science, 2764: 71–82. Springer, 2003.


Hall, Alex and Langkau, Katharina and Skutella, Martin.
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times.
Algorithmica, 47: 299–321, 2007.

Link zur Publikation

Hoogeveen, Han and Skutella, Martin and Woeginger, Gerhard J..
Preemptive scheduling with rejection.
In Mike Paterson, eds. Algorithms – ESA '00, Lecture Notes in Computer Science, 1879: 268–277. Springer, 2000.


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

Link zur Publikation

J

Jäger, Sven and Skutella, Martin.
Generalizing the Kawaguchi-Kyan Bound to Stochastic Parallel Machine Scheduling.
In Niedermeier, Rolf and Vallée, Brigitte, eds. 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), Leibniz International Proceedings in Informatics (LIPIcs), 96:  43:1–43:14. Dagstuhl, GermanySchloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2018.

Link zur Originalpublikation

K

Katriel, Irit and Kutz, Martin and Skutella, Martin.
Reachability Substitutes for Planar Digraphs.
, 2005.

Link zur Publikation

Klimm, Max and Pfetsch, Marc E. and Raber, Rico and Skutella, Martin.
Packing under Convex Quadratic Constraints.
In Proceedings of the 21st Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science . Springer, 2020.


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