CS 530 01 Advanced Algorithm Design and Analysis
Homework
(Due: 2/10)
(Total: 100 points)
1. It is possible to consider the product of matrices of size n x n, where n is a power of 3.
Using divide-and-conquer, the problem can be reduced to the multiplicat
CS 530 Advanced Algorithm Design and Analysis
Term Paper Specification
(Up to 3 students per team)
(Proposal Due: 10/15/2013)
(Term Paper Due: 12/5/2013)
The purpose of this assignment is for you to learn as a team about the design and analysis of an
algo
CS 530 01 Advanced Algorithm Design and Analysis
Homework
(Due: 10/31)
(Total: 100 points)
1. It is possible to consider the product of matrices of size n x n, where n is a power of 3.
Using divide-and-conquer, the problem can be reduced to the multiplica
The Greedy Approach
Young
CS 530 Adv. Algo.
Greedy
1
General idea:
Given a problem with n inputs, we are required to obtain a
subset that maximizes or minimizes a given objective function
subject to some constraints.
Feasible solution any subset that sati
The Theory of NP-Completeness
Peter Cappello
Department of Computer Science
University of California, Santa Barbara
Santa Barbara, CA 93106
cappello@cs.ucsb.edu
Please read the corresponding chapter before attending this lecture.
These notes are not in
CPSC490
DynamicProgramming:Partition
DynamicProgramming:Partition
We have seen the partition problem before. The input is a collection, C, of integers, and we are
interestedinasubsetwhosesumisexactlyhalfofthetotalsumofC.TheproblemisNPhard,andwe
knowthatsp
NP-Completeness (cont)
NP-Completeness (cont)
An algorithm accepts e(i) if it answers YES
An algorithm rejects e(i) if it answers NO
P = cfw_polynomially solvable concrete decision problems
P = cfw_ L | an algorithm that decides L in polynomial time
An
Approximation Algorithms
Approximation Algorithms
Introduction
In general, computer cannot solve NPC problem
efficiently
But, many NPC problems are too important to
abandon
If a problem is an NPC problem, you may try to
problem is an NPC problem you ma
CS 530 Advanced Algorithm Design and Analysis
Term Project Specification
(Up to 3 students per team)
(Proposal Due: 10/15/2013)
(Term Project Report Due: 12/5/2013)
The purpose of this assignment is for you to learn as a team about using KLA (Kinesthetic
Introduction
1. Algorithms?
2. Order
3. Analysis of Algorithm
4. Some Mathematical Background
Young
CS 530 Adv. Algo.
Topic: Introduction
1
What is an algorithm?
Simple, unambiguous, mechanical procedure to
carry out some task.
Why algorithm instead of pr
Dr. Young
Dynamic Programming
General Idea
Problem can be divided into stages with a policy decision
required at each stage. (Solution is a sequence of
decisions)
Each stage has a number of states associated with it.
The effect of the policy decision a
NP
NP-Completeness
Reference: Computers and Intractability: A
Guide to the Theory of NP
Guide to the Theory of NP-Completeness
by Garey and Johnson,
W.H. Freeman and Company, 1979.
Freeman and Company 1979
Young
CS 530 Ad. Algo. D&A
NP-Completeness
1
Gene
Divide-and-Conquer
General idea:
Divide a problem into subprograms of
the same kind; solve subprograms using
the same approach, and combine partial
solution (if necessary).
Young
CS 530 Adv. Algo.
Topic: Divide and Conquer
1
1. Find the maximum and minimu
CS 530 01 Advanced Algorithm Design and Analysis
Homework
(Due: 11/3)
(Total: 100 points)
1. It is possible to consider the product of matrices of size n x n, where n is a power of 3.
Using divide-and-conquer, the problem can be reduced to the multiplicat