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
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 l
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-an
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 s
The Theory of NP-Completeness
Peter Cappello
Department of Computer Science
University of California, Santa Barbara
Santa Barbara, CA 93106
[email protected]
Please read the corresponding chapter
CPSC490
DynamicProgramming:Partition
DynamicProgramming:Partition
We have seen the partition problem before. The input is a collection, C, of integers, and we are
interestedinasubsetwhosesumisexactlyh
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_
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 p
CS 530 01 Advanced Algorithm Design and Analysis
Homework
(Due: 10/26)
(Total: 100 points)
1. Let X(1.n) and Y(1.n) contain two lists of n integers, each sorted in nondecreasing
order. Give the best (
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 f
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 proced
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 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
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.
Top
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