TU Berlin

Prof. Dr. Martin SkutellaVeröffentlichungen

Inhalt des Dokuments

zur Navigation

Publikationen

2000

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 zur Publikation

2001

Skutella, Martin.
Convex quadratic and semidefinite programming relaxations in scheduling.
Journal of the ACM, 48: 206–242, 2001.

Link zur Publikation

Skutella, Martin and Uetz, Marc.
Scheduling precedence-constrained jobs with stochastic processing times on parallel machines.
In Proceedings of the 12th Annual ACM–SIAM Symposium on Discrete Algorithms,  589–590. Washington, DC, 2001.


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

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

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

Link zur Publikation

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.


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