Notes on topics related to algorithms

*— table of contents —*- Misc. background material
- Oblivious randomized rounding
- Greedy examples
- Greedy Set Cover I: unweighted ln(n)-approximation
- Greedy Set Cover II: weighted H(n)-approximation via random stopping time
- Greedy Set Cover III: weighted H(d)-approximation via localizing
- Set Cover / alterations
- Set Cover / using Markov to bound the cost
- Set Cover / GRASP (greedy randomized search procedure; unweighted)
- Maximum c-Matching / 2-approximation (local analysis; weighted)
- Unconstrained Set Multicover

- Lagrangian-relaxation examples

- Greedy examples
- Writing wordpress blog entries in laTeX with plog (plasTeX and blogpost)

Navigate using the menubar at the top of the window, and the arrows at the left and right edges.