CSE541 Class 9
Jeremy Buhler
September 27, 2016
1
Decision Problems
Were now going to look at some important, not-quite optimization problems.
Defn: a decision problem is a problem whose answer is ei
CSE 541 Advanced Algorithms
November 1, 2016
Homework 4 Practice Problem Solutions
WARNING: if you havent at least tried hard to solve the practice problems before reading these solutions,
you are mis
CSE 541 Advanced Algorithms
October 13, 2016
Homework 3 Practice Problems
Below is a set of practice problems on proving problems NP-complete, to help you check your understanding
of the approach weve
CSE 541 Advanced Algorithms
Fall Semester 2016
Homework 4: More NP-Completeness, and Approximation Algorithms
Assigned: 11/1/2016
Due Date: 11/15/2016
This homework must be completed and submitted ele
CSE 541 Advanced Algorithms
November 1, 2016
Homework 4 Practice Problems
Below is a set of practice problems on NP-completeness and approximation to help you check your understanding of the approache
CSE 541 Advanced Algorithms
September 21, 2016
Homework 1 Solutions
1. The given algorithm is indeed optimal.
First, observe that, without loss of generality, we need consider only schedules that use
CSE 541 Advanced Algorithms
October 18, 2016
Homework 3 Solutions
Nota bene: the reductions given here are all from the suggested problems. There are undoubtedly other
correct reductions from differen
CSE 541 Advanced Algorithms
September 26, 2016
Homework 2 Solutions
Nota bene: there are often multiple correct decompositions to solve a problem by dynamic programming. I
have picked one for each pro
CSE 541 Advanced Algorithms
Fall Semester 2016
Homework 1: Greedy Algorithms
Assigned: 9/6/2016
Due Date: 9/20/2016
This homework must be completed and submitted electronically. Formatting standards,
CSE 541 Advanced Algorithms
Fall Semester 2016
Homework 2: Dynamic Programming
Assigned: 9/22/2016
Due Date: 10/6/2016
This homework must be completed and submitted electronically. Formatting standard
CSE 541 Advanced Algorithms
September 6, 2016
Homework 1 Practice Problem Solutions
WARNING: if you havent at least tried hard to solve the practice problems before reading these solutions,
you are mi
CSE 541 Advanced Algorithms
September 22, 2016
Homework 2 Practice Problem Solutions
WARNING: if you havent at least tried hard to solve the practice problems before reading these solutions,
you are m
CSE 541 Advanced Algorithms
September 6, 2016
Homework 1 Practice Problems
Below is a set of practice problems on designing and proving the correctness of greedy algorithms, to
help you check your und
CSE 541 Advanced Algorithms
September 22, 2016
Homework 2 Practice Problems
Below is a set of practice problems on designing and proving the correctness of greedy algorithms, to
help you check your un
CSE 541 Advanced Algorithms
Fall Semester 2016
Homework 3: NP Completeness
Assigned: 10/13/2016
Due Date: 10/27/2016
This homework must be completed and submitted electronically. Formatting standards,
CSE541 Class 6
Jeremy Buhler
September 15, 2016
Today: dynamic programming, round 2 (also, linear algebra)
1
A Mathematical Conundrum
Who here has used MATLAB?
Its a program for doing math with matr
CSE 541 Advanced Algorithms
August 29, 2016
Course Overview and General Information
Your primary source for class information, homeworks, and handouts is the class web site, http:/classes.
engineering
CSE541 Class 4
Jeremy Buhler
September 8, 2016
1
The Cable Guy Problem
You are an installer for Charter Cable.
Your job is to do installations by appointment.
Appointments have a fixed length (30 m
CSE541 Class 12
Jeremy Buhler
October 6, 2016
1
A Simpler SAT
We showed last time that SAT is hard.
Maybe if we restrict the problem, it will become easier?
Will consider two restrictions on form of
CSE541 Class 18
Jeremy Buhler
November 3, 2016
1
Another Hard Problem
Lets talk about a variant of the SAT problem.
In this variant, we are given a CNF formula , and we want to find a truth assignme
CSE541 Class 15
Jeremy Buhler
October 25, 2016
1
Vertex Cover Problem
Consider the following problem.
You are a manager for Acme Security Guards, Inc.
You are assigned to guard a building whose floo
CSE541 Class 17
Jeremy Buhler
November 1, 2016
1
Set Cover Problem
Heres a very useful generalization of vertex cover.
You are trying to collect a complete set of Pokemon cards!
A complete set conta
CSE 541 Advanced Algorithms
October 13, 2016
Homework 3 Practice Problem Solutions
WARNING: if you havent at least tried hard to solve the practice problems before reading these solutions,
you are mis
CSE541 Class 20
Jeremy Buhler
November 11, 2016
1
2-Machine Scheduling With Costs
Lets consider new variant of multiprocessor scheduling problem.
Given set of n jobs.
Each job must be run on one of
CSE541 Class 10
Jeremy Buhler
September 29, 2016
1
Definition of Reduction
Even if I cant prove a problem hard in an absolute sense, I can prove that it is at least
as hard as another problem.
Let L
CSE541 Class 5
Jeremy Buhler
September 13, 2016
1
Problem: Longest Common Subsequence
Lets do some stringology!
Consider the problem of diffing two text files X and Y , each consisting of zero or
mor
CSE541 Class 19
Jeremy Buhler
November 8, 2016
1
A Different Kind of Problem
Lets go back for a bit to problems that can be solved optimally in polynomial time.
You are developing a new fad diet.
To
CSE541 Class 14
Jeremy Buhler
October 20, 2016
1
A Widget, It Has Got a Widget.
Reductions to show the hardness of graph-related problems sometimes involve building
very problem-specific graph familie
CSE541 Class 2
Jeremy Buhler
September 1, 2016
1
A Classic Problem and a Greedy Approach
A classic problem for which one might want to apply a greedy algo is knapsack.
Given: a knapsack of capacity M
CSE541 Class 13
Jeremy Buhler
October 13, 2016
1
SUBSET-SUM
Are things that are not SAT-like hard?
Lets talk about the subset-sum problem.
Input: a set S of positive integers, and a target t
Proble