TU Berlin

Prof. Dr. Martin SkutellaVeröffentlichungen

Inhalt des Dokuments

zur Navigation

Publikationen

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.


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

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

Skutella, Katharina and Skutella, Martin.
Minimum Spanning Trees – Sometimes Greed Pays Off.
In Vöcking, Berthold and Alt, Helmut and Dietzfelbinger, Martin and Reischuk, Rüdiger and Scheideler, Christian and Vollmer, Heribert and Wagner, Dorothea, eds. Algorithms Unplugged,  325–331. Springer, 2011.


Eisenbrand, Friedrich and Moran, Shay and Pinchasi, Rom and Skutella, Martin.
Node-balancing by edge-increments.
In Bansal, Nikhil and Finocchi, Irene, eds. Algorithms – ESA 2015, Lecture Notes in Computer Science, 9294: 450-458. Springer, 2015.


Skutella, Martin.
List Scheduling in Order of α-Points on a Single Machine.
In Bampis, Evripidis and Jansen, Klaus and Kenyon, Claire, eds. Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications, Lecture Notes in Computer Science, 3484: 250–291. Springer, 2006.

Link zur Publikation

Skutella, Martin.
An Introduction to Network Flows Over Time.
In Cook, William and Lovász, László and Vygen, Jens, eds. Research Trends in Combinatorial Optimization,  451–482. Springer, 2009.

Link zur Publikation

Skutella, Martin.
Convex Quadratic Programming Relaxations for Network Scheduling Problems.
In Ne\vset\vril, Jaroslav, eds. Algorithms – ESA '99, Lecture Notes in Computer Science, 1643: 127–138. Springer, 1999.


Skutella, Martin.
Approximating the single source unsplittable min-cost flow problem.
In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science,  136–145. Redondo Beach, CA, 2000.


Skutella, Martin.
Semidefinite Relaxations for Parallel Machine Scheduling.
In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science,  472–481. Palo Alto, CA, 1998.


Skutella, Martin.
Approximation and randomization in scheduling.
Technische Universität Berlin, Germany, 1998.

Link zur Publikation

Skutella, Martin.
Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem.
In Proceedings of the 8th Annual ACM–SIAM Symposium on Discrete Algorithms,  501–508. New Orleans, LA, 1997.



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.


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