Jacob Manske 31 August 2007 Exercise 01 Let f , g be asymptotically positive functions such that the limit lim f O(g). Proof. Since lim
n n n
Com S 511 - Assignment 1 f (n) exists and is finite. Pro
COMPUTER SCIENCE 511
FALL 2012
HOMEWORK 6
DUE WEDNESDAY, DECEMBER 5
R EADING
Chapter 11 and Chapter 13, Section 4, of Kleinberg &Tardos.
P ROBLEM S ET
(1)
(2)
(3)
(4)
(10 points) Exercise 1, p. 651.
(
COMPUTER SCIENCE 511
FALL 2012
HOMEWORK 2
DUE WEDNESDAY, SEPTEMBER 19
R EADING
Chapter 7 of Kleinberg &Tardos.
P ROBLEM S ET
(1)
(2)
(3)
(4)
(5)
(10 points) Exercise 18, p. 424.
(10 points) Exercise 2
COMPUTER SCIENCE 511
FALL 2012
HOMEWORK 1
DUE FRIDAY, SEPTEMBER 7
R EADING
Chapter 7 of Kleinberg &Tardos.
P ROBLEM S ET
(1) (10 points) Prove the following fact.
Lemma 1 (Flow Decomposition). Let G =
COMPUTER SCIENCE 511
FALL 2012
HOMEWORK 4
DUE FRIDAY, OCTOBER 26
R EADING
The main reference is Chapter 8 of Kleinberg & Tardos. Note that the text uses a decision
problem definition of NP, whereas in
COMPUTER SCIENCE 511
FALL 2012
HOMEWORK 3
DUE FRIDAY, OCTOBER 5
R EADING
The main references are the class notes, which are posted on Blackboard. Additional references
are:
T. Cormen, C. Leiserson, R
COMPUTER SCIENCE 511
FALL 2012
HOMEWORK 5
DUE MONDAY, NOVEMBER 12
R EADING
Kleinberg & Tardos, Chapter 10, Sections 1, 2, and 4, and the lecture notes on fixed parameter
tractability (on Blackboard).
Computer Science 511
Design and Analysis of Algorithms
Fall 2012
www.cs.iastate.edu/cs511
General Information
Description. A study of basic algorithm design and analysis techniques. Emphasis is on lea
Computer Science 511
Fall 2008
Exam 3
Thursday, December 18
This closed-book, closed-notes two-hour test consists of 6 questions. The number of
points for each problem is indicated on the next page.
Computer Science 511
Fall 2008
Exam 1
Monday, October 6
This closed-book, closed-notes two-hour test consists of 6 questions. The number of
points for each problem is indicated on the next page.
Read
Computer Science 511
Fall 2008
Exam 2
Wednesday, November 12
This closed-book, closed-notes two-hour test consists of 6 questions. The number of
points for each problem is indicated on the next page.
Computer Science 511
Fall 2006
Exam 3
Monday, December 11
This closed-book, closed-notes two-hour test consists of 6 questions. The number of
points for each problem is indicated on the next page.
Re
Wei Dong (037096059)
HW1
COMS511, August 25,2015
1: The First Problem
a) Algorithm:
IdentifyConnectedComponents(G)
1
i=1
2
for each vertex u in G.V
3
u.color=white
4
u.pi=null
5
cc(u)=0
6
time=0
7
for
COMPUTER SCIENCE 511
FALL 2015
HOMEWORK 4
DUE FRIDAY, OCTOBER 16
This assignment is about linear programming. A good reference is Chapter 29
of Cormen, Leiserson, Rivest, and Stein.
P ROBLEM S ET
(1)
Wei Dong (037096059)
HW1
COMS511, August 25,2015
1: The First Problem
a) Algorithm:
IdentifyConnectedComponents(G)
1
i=1
2
for each vertex u in G.V
3
u.color=white
4
u.pi=null
5
cc(u)=0
6
time=0
7
for
Wei Dong (037096059)
HW5
COMS511, October 21, 2015
1: The First Problem
Since Directed Hamilton Cycle is in P, we can define a polynomial algorithm
the directed graph
A (Gd ) that can decide whether
G
Wei Dong (037096059)
HW6
November 10, 2015
1: The First Problem
Algorithm:
hittingSet (B1 , , Bm , k)
create empty list L
add
B 1 , , B m on L
return hit(L, k)
hit(L, k)
if L.size=0 then return true
i
Wei Dong (037096059)
HW4
COMS511, October 11, 2015
1: The First Problem
x 1+3 x 2
Maximize
Subject to
x 1 + x 2 1
x 1x 2 3
x 1 +4 x2 2
x1 , x2 0
We initialized the LP. Since the minimum
b=3< 0 , we in
Wei Dong (037096059)
HW3
COMS511, September 30, 2015
1: The First Problem
a) Algorithm:
1. Here we will show that the problem of Building a graph from in- and out- degrees can be solved by
reducing it
(ISUid)
Solution of HW1
C OM S 511, September 16, 2015
1: Connected Components of a Graph
[Graded by Don Stull]
(a) Algorithm:
1
2
3
4
5
6
7
8
9
10
11
12
13
DFS - labelling ( G ) :
cur_label =1;
for a
Yi Zhai (447759337)
HW2
C OM S 511, September 18, 2015
1: Let f be a ow in G in which one of the edges (v, s) entering the source has f (v, s) = 1. Prove that
there must be exist another ow f (v, s) =
COMPUTER SCIENCE 511
FALL 2015
HOMEWORK 5
DUE FRIDAY, OCTOBER 30
This assignment is about NP-completeness. Good references are Chapter 8 of
Kleinberg and Tardos, and Chapter 34 of Cormen, Leiserson, R
COMPUTER SCIENCE 511
FALL 2015
HOMEWORK 1
DUE FRIDAY, SEPTEMBER 4
This assignment is a review of graph algorithms. To solve it, you will need to be
familiar with basic graph terminology, depth-rst sea
COMPUTER SCIENCE 511
FALL 2015
HOMEWORK 2
DUE FRIDAY, SEPTEMBER 18
This assignment deals with network ows and cuts. A good reference is Chapter
7, Sections 13 of Kleinberg and Tardos.
Notation. For a
COMPUTER SCIENCE 511
FALL 2015
HOMEWORK 3
DUE WEDNESDAY, SEPTEMBER 30
This assignment is about applications of network ows and cuts. A good reference is Chapter 7, Sections 511, of Kleinberg and Tardo
A
L TEX Command Summary
\* terminates a line, but disallows a pagebreak.
\] same as \endcfw_displaymath or $.
This listing contains short descriptions of the
control sequences that are likely to be ha