TU Berlin

Prof. Dr. Martin Skutella Publications

Page Content

to Navigation

Publications

S

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.


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

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

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.
Mathematical Programming, 91: 493–514, 2002.

Link to publication

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

Link to publication

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

Link to publication

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

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.
Stochastic machine scheduling with precedence constraints.
SIAM Journal on Computing, 34: 788–802, 2005.

Link to publication

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.


Skutella, Martin and Verschae, José.
A Robust PTAS for Machine Covering and Packing.
In de Berg, Mark and Meyer, Ulrich, eds. Algorithms – ESA '10, Lecture Notes in Computer Science, 6346: 36–47. Springer, 2010.

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

Skutella, Martin and Welz, Wolfgang.
Route Planning for Robot Systems.
In Hu, Bo and Morasch, Karl and Pickl, Stefan and Siegle, Markus, eds. Operations Research Proceedings 2010,  307–312. Springer, 2011.


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

Skutella, Martin and Woeginger, Gerhard J..
A PTAS for Minimizing the Weighted Sum of Job Completion Times on Parallel Machines.
In Proceedings of the 31st Annual ACM Symposium on Theory of Computing,  400–407. Atlanta, GA, 1999.


Z

Ziemke, Theresa and Sering, Leon and Vargas Koch, Laura and Zimmer, Max and Nagel, Kai and Skutella, Martin.
Flows Over Time as Continuous Limits of Packet-Based Network Simulations.
Transportation Research Procedia, 52: 123–130, 2021.


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

Quick Access

Schnellnavigation zur Seite über Nummerneingabe