Gustav Hast. Beating a Random Assignment. In Chandra Chekuri, Klaus Jansen, José D. P. Rolim, Luca Trevisan, editors, Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computat. Volume 3624 of Lecture Notes in Computer Science, pages 134-145, Springer, 2005. [doi]
No references recorded for this publication.
No citations of this publication recorded.