Week 1: Introduction
Connectedness, Cut-Vertices/-Edges, DFS with Low Values
This page contains the slides weekly exercise and other useful materials for the course Algorithms & Probability.
Connectedness, Cut-Vertices/-Edges, DFS with Low Values
Hamiltonian Cycles, Dirac, TSP (2-Approximation)
Augmenting Path, Frobenius, TSP (1.5-Approximation)
Greedy Algorithm, Heuristic, Brooks, 3-Colorable Graphs
Notation, Addition-/Multiplication Rule, Inclusion-Exclusion Principle, Union Bound, Combinatorics, Conditional Probability, Law of total Probability
Bayes Theorem, Independence, Random Variables, PDF/CDF, Expected Value, Linearity of Expectation, Indicator Variables, (Distributed Algorithms)
Variance, Standard Deviation, Coupon Collector, Probability Distributions: Bernoulli, Binomial, Geometric, Poisson