Randomized Algorithms
by Wolfgang Merkle
Publisher: ESSLLI 2001
Number of pages: 46
Description:
The first part of the course gives an introduction to randomized algorithms and to standard techniques for their derandomization. The second part presents applications of the probabilistic method to the construction of logical models and briefly discusses related issues such as Rado-graphs and 0-1 laws.
Download or read it online for free here:
Download link
(370KB, PDF)
Similar books
Think Data Structuresby Allen B. Downey - Green Tea Press
This book is intended for college students in computer science and related fields. The book also presents basic aspects of software engineering practice, including version control and unit testing. Each chapter ends with an exercises.
(4762 views)
Tabu Searchby Wassim Jaziri - InTech
Tabu search is a mathematical optimization method. The goal of the book is to report original researches on algorithms and applications of Tabu Search to real-world problems as well as recent improvements and extensions on its concepts and algorithms.
(9813 views)
Data Structures and Algorithmsby Catherine Leung - GitBook
This book is a survey of several standard algorithms and data structures. It will also introduce the methodology used to perform a formal analysis of an algorithm so that the reason behind the different implementations can be better understood.
(4195 views)
The Design of Approximation Algorithmsby D. P. Williamson, D. B. Shmoys - Cambridge University Press
This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.
(10763 views)