direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

Publications

2002

Schulz, Andreas S. and Skutella, Martin.
The Power of α-Points in Preemptive Single Machine Scheduling.
Journal of Scheduling, 5: 121–133, 2002.

Link to publication

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

Link to publication

2001

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

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.


2000

Goemans, Michel X. and Skutella, Martin.
Cooperative facility location games.
In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms,  76–85. San Francisco, CA, 2000.


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.


Möhring, Rolf H. and Skutella, Martin and Stork, Frederik.
Forcing Relations for AND/OR Precedence Constraints.
In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms,  235–236. San Francisco, CA, 2000.


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

1999

Afrati, Foto and Bampis, Evripidis and Chekuri, Chandra and Karger, David and Kenyon, Claire and Khanna, Sanjeev and Milis, Ioannis and Queyranne, Maurice and Skutella, Martin and Stein, Cliff and Sviridenko, Maxim.
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates.
In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science,  32–43. New York City, NY, 1999.

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


1998

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

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

1997

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

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


1995


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

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

This site uses Matomo for anonymized webanalysis. Visit Data Privacy for more information and opt-out options.