[Lecture Notes in Computer Science] STACS 2005 Volume 3404 || Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics

[Lecture Notes in Computer Science] Appr

[Lecture Notes in Computer Science] Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Volume 4110 || Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time Hierarchy

✍ Díaz, Josep; Jansen, Klaus; Rolim, José D. P.; Zwick, Uri 📂 Article 📅 2006 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 452 KB

This is the joint refereed proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and the 10th International Workshop on Randomization and Computation, RANDOM 2006. The book presents 44 carefully reviewed and revised full papers