Next: Primal Dual Method for
Up: No Title
Previous: Computing Near Optimal Schedules
- D.B. Shmoys, Computing Near-Optimal Solutions to Combinatorial Optimization Problems, Sect. 2, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. ???, 1995
- R. Motwani, Lecture Notes on Approximation Algorithms, Stanford University, 1992, Chapter 4.1 & 4.2
(ohne randomisierte Algorithmen)
Claus Rick
Wed Jul 10 10:24:31 MET DST 1996