direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publikationen

2004

Möhring, Rolf H. and Skutella, Martin and Stork, Frederik.
Scheduling with AND/OR Precedence Constraints.
SIAM Journal on Computing, 33: 393–415, 2004.

Link zur Publikation

Martens, Maren and Skutella, Martin.
Flows on Few Paths: Algorithms and Lower Bounds.
In Albers, Susanne and Radzik, Tomasz, eds. Algorithms – ESA '04, Lecture Notes in Computer Science, 3221: 520–531. Springer, 2004.


Sanders, Peter and Sivadasan, Naveen and Skutella, Martin.
Online Scheduling with Bounded Migration.
In Diaz, Josep and Karhumäki, Juhani and Lepistö, Arto and Sannella, Donald, eds. Automata, Languages and Programming, Lecture Notes in Computer Science, 3142: 1111–1122. Springer, 2004.


2003

Fekete, Sándor P. and Skutella, Martin and Woeginger, Gerhard J..
The complexity of economic equilibria for house allocation markets.
Information Processing Letters, 88: 219–223, 2003.

Link zur Publikation

Fleischer, Lisa and Skutella, Martin.
Minimum Cost Flows Over Time without Intermediate Storage.
In Proceedings of the 14th Annual ACM–SIAM Symposium on Discrete Algorithms,  66–75. Baltimore, MD, 2003.


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 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.


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

Link zur Publikation

2002

Arkin, Esther M. and Bender, Michael A. and Fekete, Sándor P. and Mitchell, Joseph S. B. and Skutella, Martin.
The freeze-tag problem: How to wake up a swarm of robots.
In Proceedings of the 13th Annual ACM–SIAM Symposium on Discrete Algorithms,  568–577. San Francisco, CA, 2002.


Baier, Georg and Köhler, Ekkehard and Skutella, Martin.
On the k-splittable flow problem.
In Möhring, Rolf H. and Raman, Rajeev, eds. Algorithms – ESA '02, Lecture Notes in Computer Science, 2461: 101–113. Springer, 2002.


Fleischer, Lisa and Skutella, Martin.
The quickest multicommodity flow problem.
In Cook, William J. and Schulz, Andreas S., eds. Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, 2337: 36–53. Springer, 2002.


Goemans, Michel X. and Queyranne, Maurice and Schulz, Andreas S. and Skutella, Martin and Wang, Yaoguang.
Single machine scheduling with release dates.
SIAM Journal on Discrete Mathematics, 15: 165–192, 2002.

Link zur Publikation

Köhler, Ekkehard and Langkau, Katharina and Skutella, Martin.
Time-Expanded Graphs for Flow-Dependent Transit Times.
In Möhring, Rolf H. and Raman, Rajeev, eds. Algorithms – ESA '02, Lecture Notes in Computer Science, 2461: 599–611. Springer, 2002.

Link zur Publikation

Köhler, Ekkehard and Skutella, Martin.
Flows over time with load-dependent transit times.
In Proceedings of the 13th Annual ACM–SIAM Symposium on Discrete Algorithms,  174–183. San Francisco, CA, 2002.


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

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.

Zusatzinformationen / Extras

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe

Diese Seite verwendet Matomo für anonymisierte Webanalysen. Mehr Informationen und Opt-Out-Möglichkeiten unter Datenschutz.