15451 Algorithms, Fall 2014, Gupta and Sleator
Lecture 11: Dinics Algorithm
Wed. October 1, 2014
Dinics algorithm is a way of implementing the EdmondsKarp # 2 algorithm mentioned in
the Avrims Network Flows II lecture notes. (Please see those notes for
Lovsz's reduction of
COLORABILITY to 3COLORABILITY
(Lecture notes written by Vaek Chvtal)
A problem and an infinite sequence of problems.
Consider the problem
COLORABILITY
Input: A graph G and a positive integer k.
Question: Is G kcolorable?
and, for ea
Chapter 14 in "Online Algorithms: the state of the art", Fiat and Woeginger eds., LNCS #1442, 1998.
OnLine Algorithms in Machine Learning
Avrim Blum
Carnegie Mellon University, Pittsburgh PA 15213. Email: avrim@cs.cmu.edu
Abstract. The areas of OnLine A
15451 Algorithms
Fall 2014
D. Sleator
Closest Pairs November 17, 2014

We'll give two algorithms for the following proglem:
Given n points in the plane, find the pair of points that is the
closest together.
The first algorithm is a deterministic divide
15451 Assignment 1
Abhishek Bhowmick
abhowmi1@andrew.cmu.edu
Recitation: D
30 August, 2014
*This homework was solved in collaboration with Neil Dhruva.
1: Compare and Contrast
(a) We are given a set S of n distinct and arbitrary numbers. Let k = n n3/4 (
15451 Algorithms
D. Sleator
Amortized analysis  growing and shrinking a table
I'm sure you all know the trick of doubling an array when it needs to
grow. Then the amortized cost of all the growing operations is still
O(1). Why? Because if the array end