Algorithms: CSE 202 Homework I
Problem 1: Stable matching with indierence (KT 1.5)
The Stable Matching Problem, as discussed in the text, assumes that all men and women have a
fully ordered list of preferences. In this problem we will consider a version o

Algorithms: CSE 202 Homework II
Solve problems 2, 3, 4, 6, and 7.
Problem 1: The tramp steamer problem (DPV)
You are the owner of a steamship that can ply between a group of port cities V . You make money
at each port: a visit to city i earns you a profit

Lemma
1
Algorithms: CSE 202 Homework IV
Problem 1: Graphical Steiner tree (KT 8.38)
Consider the following version of the Steiner Tree Problem, which well refer to as Graphical Steiner
Tree. You are given an undirected graph G = (V, E), a set X V of verti

CSE 202: Design and Analysis of Algorithms
Spring 2016
Problem Set 1
Instructor: Kamalika Chaudhuri
Due on: Fri Apr 22
Instructions
For your proofs, you may use any lower bound, algorithm or data structure from the text or in class,
and their correctness

CSE 202: Design and
Analysis of Algorithms
!
Lecture 2
!
Greedy Algorithms
Minimum Spanning Trees
The Union/Find Data Structure
A Network Design Problem
Problem: Given distances between a set of computers, find the
cheapest set of pairwise connection

CS 105: Algorithms (Grad)
Set Cover and Application to Shortest Superstring
1
1.1
Valika K. Wan & Khanh Do Ba
Feb 21-24, 2005
Approximating Set Cover
Definition
An Instance (X, F ) of the set-covering problem consists of a finite set X and a family F of
s