CSC 2420 Fall 2012, Assignment 3
Due: December 14
1. We are given a degree bound d and query access to a partial table for a
function f : Q Q; namely given cfw_(x1 , f (x1 ), . . . , (xn , f (xn ) we can
access any (xi , f (xi ) in one query. We consider
CSC 2420: Lecture 10
Streaming Algorithms: Frequency Moments and Count-Min Sketch
Lecturer: Professor Allan Borodin
1
Scribe: Amirali Salehi-Abari
Introduction
Usually, a streaming algorithm is used in scenarios in which there are a lot of data (items)
ar
CSC2420: Algorithm Design, Analysis and Theory
Topic: Markov Chain and Randomized Rounding
Lecturer: Prof. Allan Borodin
22.1
Date: Nov 24, 2010
Scribe: Chun Kong Yung
Outline
In the rst half of this lecture, we will cover some topics concerning Markov ch
Lecture # 12
Lecturer: Prof. Allan Borodin
Scribe: Yeleiny Bonilla
Agenda:
I.
II.
III.
IV.
V.
I.
Finish discussion of Vector Program Relaxation for Max-Cut problem.
Briefly discuss same approach for Max-2-Sat.
The constructive Lovasz Local Lemma (LLL).
Th
CSC2420: Algorithm Design, Analysis and Theory
Nov 3, 2010
Lecture Notes 8: Sublinear Algorithms
Professor: Allan Borodin
Scribe: Dai Tri Man L
e
Before we start with sublinear algorithms, we will nish the proof that we promised in the
previous lecture.
1
Lecture 7
Lecturer: Prof. Allan Borodin
Scribe: Ioana Ivan
Independence systems:
Let M = (E , F ), where E is a set of elements, F 2|E | and, if I F , I is called an independent set.
An independence system satises the following properties:
1) F
2) S T , T
CSC2420 Algorithm Design, Analysis and Theory
September 22, 2010
Lecture 2
Lecturer: Allan Borodin
1
Scribe: Joel Oren
The makespan problem for identical machines continued
Last time we gave a Brute force+Greedy algorithm that runs in O(mms n)-time to get
Lecture 1
Allan Borodin
(Recorded by Alexandra Goultiaeva)
Sept. 15, 2010
1
Introduction
This is a graduate level course on Algorithm Design, Analysis and Theory.
We used to have many specialized courses, such as advanced graph theory,
approximation algor
CS 2420 - Algorithm Design, Analysis and Theory
Lecture #3: 29 September 2010
CS 2420 - Algorithm Design, Analysis and Theory
Lecture #3: 29 September 2010
Lecturer: Brendan Lucier
Scribe Notes by: Anastasios Zouzias
1
Outline of this Lecture
2-approxima
CSC2420: Algorithm Design, Analysis and Theory
Scribe: Recep Colak
Topic: Linear Programming and Duality
4.1
Lecturer: Allan Borodin
Date: 2010/10/06
Introduction
In the rst three lectures we have reviewed the fundamental algorithmic approaches including
CSC2420 - Fall 2010 - Lecture 6
Lecturer: Prof. Allan Borodin
Scribe: Frank Vanderzwet
20-October-2010
1
Last Time and k+1 Claw Free Graphs
Last time we discussed greedy algorithms relating to weighted MISproblem. We also noted that
k-set packing can be v
CSC2420 - Fall 2010 - Lecture 5
Lecturer: Prof. Allan Borodin
Scribe: Gokul Sridharan
13-October-2010
In the previous lecture we developed an LP formulation for the f -frequency weighted set cover
problem and further noted that the weighted vertex cover p