Académique Documents
Professionnel Documents
Culture Documents
Outline
Brute Force Algorithms
Closest Pair
Convex Hull
Travelling Salesperson Problem (TSP)
Knapsack Problem
P, N P, and N P-hard
Searching
Depth-First Search
Breadth-First Search
Brute Force
Patrick
Brute Force
Closest Pair
Convex Hull
TSP
Knapsack
P, N P, and
N P-hard
Searching
Depth-First
Breadth-First
29
Outline
Brute Force Algorithms
Closest Pair
Convex Hull
Travelling Salesperson Problem (TSP)
Knapsack Problem
P, N P, and N P-hard
Searching
Depth-First Search
Breadth-First Search
Brute Force
Patrick
3
Brute Force
Closest Pair
Convex Hull
TSP
Knapsack
P, N P, and
N P-hard
Searching
Depth-First
Breadth-First
29
Brute Force
Closest Pair
Convex Hull
TSP
Knapsack
P, N P, and
N P-hard
Simplistic
Searching
Depth-First
Breadth-First
Sometimes Useful
29
Brute Force
Closest Pair
Convex Hull
TSP
Knapsack
P, N P, and
N P-hard
Searching
Depth-First
Breadth-First
29
Closest Pair
Convex Hull
TSP
Knapsack
P, N P, and
N P-hard
n Points
Searching
d Dimensions
Depth-First
Breadth-First
29
Closest Pair
Convex Hull
TSP
Knapsack
P, N P, and
N P-hard
Years Experience?
Searching
Depth-First
Breadth-First
Serve Speed?
Serve Accuracy?
More?
29
Closest Pair
Convex Hull
TSP
Knapsack
P, N P, and
N P-hard
n Features
Searching
Depth-First
Breadth-First
29
Closest Pair
Convex Hull
TSP
Knapsack
P, N P, and
N P-hard
Searching
Depth-First
Breadth-First
29
q
Can We Speed Up (x1 y1 )2 + (x2 y2 )2 + + (xd yd )2 ?
Closest Pair
Convex Hull
TSP
Knapsack
P, N P, and
N P-hard
Yes
Searching
Depth-First
Breadth-First
Constant Factor
Still n2
29
Convex Hull
Brute Force
Patrick
Brute Force
11
Closest Pair
Convex Hull
TSP
Knapsack
P, N P, and
N P-hard
Collection of Points
Searching
Depth-First
Breadth-First
29
Convex Hull
Complexity
Brute Force
Patrick
Brute Force
12
n
k
Closest Pair
Convex Hull
TSP
Knapsack
P, N P, and
N P-hard
Searching
Depth-First
Breadth-First
29
13
Closest Pair
Convex Hull
TSP
Knapsack
P, N P, and
N P-hard
Searching
Depth-First
Breadth-First
3. Finish in City 1
Path Called a Hamiltonian Path
29
TSP
Example
Brute Force
Patrick
Brute Force
14
Closest Pair
Convex Hull
TSP
Knapsack
P, N P, and
N P-hard
Searching
Depth-First
Breadth-First
29
TSP
Question: What is the complexity of a Brute Force approach to the Travelling Salesperson
Problem?
Brute Force
Patrick
Brute Force
15
A. O (n)
P, N P, and
N P-hard
B. O (2n)
C. O n2
D. O
Closest Pair
Convex Hull
TSP
Knapsack
Searching
Depth-First
Breadth-First
(2n )
E. O (n!)
29
Knapsack Problem
Brute Force
Patrick
Brute Force
16
Closest Pair
Convex Hull
TSP
Knapsack
P, N P, and
N P-hard
Searching
Depth-First
Breadth-First
29
Outline
Brute Force Algorithms
Closest Pair
Convex Hull
Travelling Salesperson Problem (TSP)
Knapsack Problem
P, N P, and N P-hard
Searching
Depth-First Search
Breadth-First Search
Brute Force
Patrick
Brute Force
Closest Pair
Convex Hull
TSP
Knapsack
18
P, N P, and
N P-hard
Searching
Depth-First
Breadth-First
29
Closest Pair
Convex Hull
TSP
Knapsack
19
P, N P, and
N P-hard
Searching
Depth-First
Breadth-First
29
Outline
Brute Force Algorithms
Closest Pair
Convex Hull
Travelling Salesperson Problem (TSP)
Knapsack Problem
P, N P, and N P-hard
Searching
Depth-First Search
Breadth-First Search
Brute Force
Patrick
Brute Force
Closest Pair
Convex Hull
TSP
Knapsack
P, N P, and
N P-hard
20
Searching
Depth-First
Breadth-First
29
Depth-First Search
Brute Force
Patrick
Brute Force
Closest Pair
Convex Hull
TSP
Knapsack
P, N P, and
N P-hard
Searching
21
3. Repeat
29
Depth-First
Breadth-First
Depth-First Search
Brute Force
Patrick
Brute Force
Closest Pair
Convex Hull
TSP
Knapsack
P, N P, and
N P-hard
10
Searching
22
11
12
5 4 2 8 6 7 10 9 11 12
29
Depth-First
Breadth-First
Breadth-First Search
Brute Force
Patrick
Brute Force
Closest Pair
Convex Hull
TSP
Knapsack
P, N P, and
N P-hard
Searching
3. Repeat
23
29
Depth-First
Breadth-First
Breadth-First Search
Brute Force
Patrick
Brute Force
Closest Pair
Convex Hull
TSP
Knapsack
P, N P, and
N P-hard
10
Searching
24
11
12
5 4 8 2 6 10 7 9 11 12
29
Depth-First
Breadth-First
Depth-First Search
In Graphs
Brute Force
d f s P a t h (A , B , [ A | R e s t O f P a t h ] ) :
e d g e (A , Next ) ,
n o n r e p e a t i n g P a t h ( Next , B , [ A ] , R e s t O f P a t h ) .
Patrick
Brute Force
Closest Pair
Convex Hull
TSP
Knapsack
n o n r e p e a t i n g P a t h (B , B , , [ B ] ) .
nonrepeatingPath ( Current , B, V i s i t e d , [ Current | RestOfPath ]):
e d g e ( C u r r e n t , Next ) ,
n o t ( member ( Next , V i s i t e d ) ) ,
n o n r e p e a t i n g P a t h ( Next , B , [ C u r r e n t | V i s i t e d ] , R e s t O f P a t h ) .
P, N P, and
N P-hard
Searching
25
29
Depth-First
Breadth-First
P, N P, and
N P-hard
Breadth-First Search
U.S. Presidency
Depth-First Search
British Monarchy
Searching
26
29
Depth-First
Breadth-First
P, N P, and
N P-hard
Searching
27
29
Depth-First
Breadth-First
External References I
Brute Force
Patrick
Brute Force
Closest Pair
Convex Hull
TSP
Knapsack
P, N P, and
N P-hard
Searching
28
29
Depth-First
Breadth-First
Any Questions?
Brute Force
Patrick
Brute Force
Closest Pair
Convex Hull
TSP
Knapsack
P, N P, and
N P-hard
Searching
29
29
Depth-First
Breadth-First