direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments



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

Link zur Publikation


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


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


Schnellnavigation zur Seite über Nummerneingabe

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