References


Text Books:

  • Beyond the Worst-Case Analysis of Algorithms, Tim Roughgarden (ed), Cambridge University Press, 2020
  • Probability Theory of Classical Euclidean Optimization Problems Joseph Yukich, Springer, 1998

Reference Books

  • Probability Theory and Combinatorial Optimization, Michael Steele, SIAM, 1997.
  • Concentration of Measure for the Analysis of Randomized Algorithms, Devdatt P. Dubhashi, and Alessandro Panconesi, Cambridge University Press, 2011
  • Introduction to Random Graphs: Alan Frieze and Michał Karońskil, Cambridge University Press, 2016
  • Average-Case Complexity, Andrej Bogdanov and Luca Trevisan, Foundations and Trends in Theoretical Computer Science, Vol 2, No 1, 2006, NOW Publishers.
  • Recent research papers on the topics.