Massachusetts Institute of Technology 6.854J/18.415J: Advanced Algorithms David Karger
Handout 9 Wednesday, October 9, 2009
Problem Set 5
Due: Wednesday, October 16, 2009. Collaboration policy: collaboration is strongly encouraged. However, remember that
Massachusetts Institute of Technology 6.854J/18.415J: Advanced Algorithms David Karger
Handout 3 Wednesday, September 16, 2009
Problem Set 2
Due: Wednesday, September 23, 2009. Collaboration policy: collaboration is strongly encouraged. However, remember
Massachusetts Institute of Technology 6.854J/18.415J: Advanced Algorithms David Karger
Handout 12 Wed, October 21, 2009
Problem Set 5 Solutions
Wed, October 21, 2009 Problem 1. For reference, the linear program is as follows: minimize cx s.t. x1 + x2 1 x1
Massachusetts Institute of Technology 6.854J/18.415J: Advanced Algorithms David Karger
Handout 12 Mon, October 26, 2009
Problem Set 5 Solutions
Mon, October 26, 2009 Problem 1. (a) We know any LP P can be written in standard form, i.e. minimize T c x subj
Massachusetts Institute of Technology 6.854J/18.415J: Advanced Algorithms David Karger
Handout 11 Wednesday, October 14, 2009
Problem Set 6
Due: Wednesday, October 21, 2009. Collaboration policy: collaboration is strongly encouraged. However, remember tha
Massachusetts Institute of Technology 6.854J/18.415J: Advanced Algorithms David Karger
Handout 5 Wednesday, September 23, 2009
Problem Set 3
Due: Wednesday, September 30, 2009. Collaboration policy: collaboration is strongly encouraged. However, remember
Massachusetts Institute of Technology 6.854J/18.415J: Advanced Algorithms David Karger
Handout 10 Friday, October 9, 2009
Problem Set 4 Solutions
Friday, October 9, 2009 Problem 1. First, we go through the elements in Y . For all dij given in Y , we reduc
Massachusetts Institute of Technology 6.854J/18.415J: Advanced Algorithms David Karger
Handout 4 Monday, September 21, 2009
Problem Set 1 Solutions
Problem 1. Suppose we have a Fibonacci heap that is a single chain of k 1 nodes. The following operations m
Massachusetts Institute of Technology 6.854J/18.415J: Advanced Algorithms David Karger
Handout 2 Wednesday, September 9, 2009
Problem Set 1
Due: Wednesday, September 16, 2009. Collaboration policy: collaboration is strongly encouraged. However, remember t
Massachusetts Institute of Technology 6.854J/18.415J: Advanced Algorithms David Karger
Handout 7 Wednesday, September 30, 2009
Problem Set 4
Due: Wednesday, October 7, 2009. Collaboration policy: collaboration is strongly encouraged. However, remember tha
Massachusetts Institute of Technology 6.854J/18.415J: Advanced Algorithms David Karger
Handout 13 Wednesday, October 21, 2009
Problem Set 7
Due: Wednesday, October 28, 2009. Collaboration policy: collaboration is strongly encouraged. However, remember tha
Massachusetts Institute of Technology 6.854J/18.415J: Advanced Algorithms David Karger
Handout 15 Wednesday, October 28, 2009
Problem Set 8
Due: Friday, November 6, 2009. Collaboration policy: collaboration is strongly encouraged. However, remember that 1
Massachusetts Institute of Technology 6.854J/18.415J: Advanced Algorithms David Karger
Handout 17 Friday, November 6, 2009
Problem Set 9
Due: Friday, November 13, 2009. Collaboration policy: collaboration is strongly encouraged. However, remember that 1.
Massachusetts Institute of Technology 6.854J/18.415J: Advanced Algorithms David Karger
Handout 19 Friday, November 13, 2009
Problem Set 10
Due: Wednesday, November 18, 2009. Collaboration policy: collaboration is strongly encouraged. However, remember tha
Massachusetts Institute of Technology 6.854J/18.415J: Advanced Algorithms David Karger
Handout 6 Wednesday, September 30, 2009
Problem Set 2 Solutions
Wednesday, September 30, 2009 Collaboration policy: collaboration is strongly encouraged. However, remem
Massachusetts Institute of Technology 6.854J/18.415J: Advanced Algorithms David Karger
Handout 8 Wednesday, October 7, 2009
Problem Set 3 Solutions
Wednesday, October 7, 2009 Problem 1. (a) Consider the (k + 1)st item inserted. Since only k buckets (at wo
Massachusetts Institute of Technology 6.854J/18.415J: Advanced Algorithms David Karger
Handout 16 Fri, October 30, 2009
Problem Set 7 Solutions
Fri, October 30, 2009 Problem 1. (a) The algorithm repeats the following step k times, or until S = :
Arbitrari
Massachusetts Institute of Technology 6.854J/18.415J: Advanced Algorithms David Karger
Handout 18 Fri, November 13, 2009
Problem Set 8 Solutions
Fri, November 13, 2009 Problem 1. (a) Given sets S1 . . . Sn , set cover asks for a minimum size collection C
Massachusetts Institute of Technology 6.854J/18.415J: Advanced Algorithms David Karger
Handout 20 Monday, November 23, 2009
Problem Set 9 Solutions
Monday, November 23, 2009 Collaboration policy: collaboration is strongly encouraged. However, remember tha
Massachusetts Institute of Technology 6.854J/18.415J: Advanced Algorithms David Karger
Handout 23 Monday, November 23, 2009
Problem Set 10 Solutions
Monday, November 23, 2009 Collaboration policy: collaboration is strongly encouraged. However, remember th