Presentation is loading. Please wait.

Presentation is loading. Please wait.

Chapter 12 Coping with the Limitations of Algorithm Power Copyright © 2007 Pearson Addison-Wesley. All rights reserved.

Published byCandace Briana Franklin Modified over 9 years ago

Similar presentations

Presentation on theme: "Chapter 12 Coping with the Limitations of Algorithm Power Copyright © 2007 Pearson Addison-Wesley. All rights reserved."— Presentation transcript:

1 Chapter 12 Coping with the Limitations of Algorithm Power Copyright © 2007 Pearson Addison-Wesley. All rights reserved.

2 Copyright © 2007 Pearson Addison-Wesley. All rights reserved Design and Analysis of Algorithms - Chapter 12 12-1 How to tackle those difficult problems... There are two principal approaches to tackling NP-hard problems or other “intractable” problems: b Use a strategy that guarantees solving the problem exactly but doesn’t guarantee to find a solution in polynomial time b Use an approximation algorithm that can find an approximate (sub-optimal) solution in polynomial time

3 Copyright © 2007 Pearson Addison-Wesley. All rights reserved Design and Analysis of Algorithms - Chapter 12 12-2 Exact solutions The exact solution approach includes the strategies: b exhaustive search (brute force) useful only for small instancesuseful only for small instances b backtracking eliminates some cases from considerationeliminates some cases from consideration b branch-and-bound further cuts down on the searchfurther cuts down on the search fast solutions for most instancesfast solutions for most instances worst case is still exponentialworst case is still exponential

4 Copyright © 2007 Pearson Addison-Wesley. All rights reserved Design and Analysis of Algorithms - Chapter 12 12-3 Backtracking b Construct the state space tree: nodes: partial solutionsnodes: partial solutions edges: choices in completing solutionsedges: choices in completing solutions b Explore the state space tree using depth-first search b “Prune” non-promising nodes dfs stops exploring subtree rooted at nodes leading to no solutions and...dfs stops exploring subtree rooted at nodes leading to no solutions and... “backtracks” to its parent node“backtracks” to its parent node

5 Copyright © 2007 Pearson Addison-Wesley. All rights reserved Design and Analysis of Algorithms - Chapter 12 12-4 Example: The n-Queen problem b Place n queens on an n by n chess board so that no two of them are on the same row, column, or diagonal

6 Copyright © 2007 Pearson Addison-Wesley. All rights reserved Design and Analysis of Algorithms - Chapter 12 12-5 State-space of the four-queens problem

7 Copyright © 2007 Pearson Addison-Wesley. All rights reserved Design and Analysis of Algorithms - Chapter 12 12-6 Example: The m-coloring problem b Given a graph and an integer m, color its vertices using no more than m colors so that no two adjacent vertices are the same color. cd a eb

8 Copyright © 2007 Pearson Addison-Wesley. All rights reserved Design and Analysis of Algorithms - Chapter 12 12-7 Branch and Bound b An enhancement of backtracking b Applicable to optimization problems b Uses a lower bound for the value of the objective function for each node (partial solution) so as to: guide the search through state-space guide the search through state-space rule out certain branches as “unpromising” rule out certain branches as “unpromising” 8 17 10 8 14 11 13 12 20 17

9 Copyright © 2007 Pearson Addison-Wesley. All rights reserved Design and Analysis of Algorithms - Chapter 12 12-8 Select one element in each row of the cost matrix C so that: no two selected elements are in the same column; and no two selected elements are in the same column; and the sum is minimized the sum is minimized For example: Job 1Job 2Job 3Job 4 Person a 9 2 7 8 Person b 6 4 3 7 Person c 5 8 1 8 Person d 7 6 9 4 Lower bound: Any solution to this problem will have total cost of at least: Example: The assignment problem

10 Copyright © 2007 Pearson Addison-Wesley. All rights reserved Design and Analysis of Algorithms - Chapter 12 12-9 Assignment problem: lower bounds

11 Copyright © 2007 Pearson Addison-Wesley. All rights reserved Design and Analysis of Algorithms - Chapter 12 12-10 State-space levels 0, 1, 2

12 Copyright © 2007 Pearson Addison-Wesley. All rights reserved Design and Analysis of Algorithms - Chapter 12 12-11 Complete state-space

13 Copyright © 2007 Pearson Addison-Wesley. All rights reserved Design and Analysis of Algorithms - Chapter 12 12-12

14 Copyright © 2007 Pearson Addison-Wesley. All rights reserved Design and Analysis of Algorithms - Chapter 12 12-13 Traveling salesman example:

Download ppt "Chapter 12 Coping with the Limitations of Algorithm Power Copyright © 2007 Pearson Addison-Wesley. All rights reserved."

Similar presentations

Types of Algorithms.

Types of Algorithms.
Games & Adversarial Search Chapter 5. Games vs. search problems Unpredictable opponent  specifying a move for every possible opponent’s reply. Time.

Games & Adversarial Search Chapter 5. Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent’s reply. Time.
Techniques for Dealing with Hard Problems Backtrack: –Systematically enumerates all potential solutions by continually trying to extend a partial solution.

Techniques for Dealing with Hard Problems Backtrack: –Systematically enumerates all potential solutions by continually trying to extend a partial solution.
5-1 Chapter 5 Tree Searching Strategies. 5-2 Satisfiability problem Tree representation of 8 assignments. If there are n variables x 1, x 2, …,x n, then.

5-1 Chapter 5 Tree Searching Strategies. 5-2 Satisfiability problem Tree representation of 8 assignments. If there are n variables x 1, x 2, …,x n, then.
Branch & Bound Algorithms

Branch & Bound Algorithms
September 26, 2012Introduction to Artificial Intelligence Lecture 7: Search in State Spaces I 1 After our “Haskell in a Nutshell” excursion, let us move.

September 26, 2012Introduction to Artificial Intelligence Lecture 7: Search in State Spaces I 1 After our “Haskell in a Nutshell” excursion, let us move.
Eight queens puzzle. The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard such that none of them are able to capture.

Eight queens puzzle. The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard such that none of them are able to capture.
S. J. Shyu Chap. 1 Introduction 1 The Design and Analysis of Algorithms Chapter 1 Introduction S. J. Shyu.

S. J. Shyu Chap. 1 Introduction 1 The Design and Analysis of Algorithms Chapter 1 Introduction S. J. Shyu.
Algorithm Strategies Nelson Padua-Perez Chau-Wen Tseng Department of Computer Science University of Maryland, College Park.

Algorithm Strategies Nelson Padua-Perez Chau-Wen Tseng Department of Computer Science University of Maryland, College Park.
Branch and Bound Searching Strategies

Branch and Bound Searching Strategies
6 - 1 § 6 The Searching Strategies e.g. satisfiability problem x1x1 x2x2 x3x3 FFF FFT FTF FTT TFF TFT TTF TTT.

6 - 1 § 6 The Searching Strategies e.g. satisfiability problem x1x1 x2x2 x3x3 FFF FFT FTF FTT TFF TFT TTF TTT.
Branch and Bound Similar to backtracking in generating a search tree and looking for one or more solutions Different in that the “objective” is constrained.

Branch and Bound Similar to backtracking in generating a search tree and looking for one or more solutions Different in that the “objective” is constrained.
Chapter 8 Dynamic Programming Copyright © 2007 Pearson Addison-Wesley. All rights reserved.

Chapter 8 Dynamic Programming Copyright © 2007 Pearson Addison-Wesley. All rights reserved.
MAE 552 – Heuristic Optimization Lecture 26 April 1, 2002 Topic:Branch and Bound.

MAE 552 – Heuristic Optimization Lecture 26 April 1, 2002 Topic:Branch and Bound.
1 Branch and Bound Searching Strategies 2 Branch-and-bound strategy 2 mechanisms: A mechanism to generate branches A mechanism to generate a bound so.

1 Branch and Bound Searching Strategies 2 Branch-and-bound strategy 2 mechanisms: A mechanism to generate branches A mechanism to generate a bound so.
Ch 13 – Backtracking + Branch-and-Bound

Ch 13 – Backtracking + Branch-and-Bound
1 Tree Searching Strategies. 2 The procedure of solving many problems may be represented by trees. Therefore the solving of these problems becomes a tree.

1 Tree Searching Strategies. 2 The procedure of solving many problems may be represented by trees. Therefore the solving of these problems becomes a tree.
Backtracking Reading Material: Chapter 13, Sections 1, 2, 4, and 5.

Backtracking Reading Material: Chapter 13, Sections 1, 2, 4, and 5.
Games & Adversarial Search Chapter 6 Section 1 – 4.

Games & Adversarial Search Chapter 6 Section 1 – 4.
5-1 Chapter 5 Tree Searching Strategies. 5-2 Breadth-first search (BFS) 8-puzzle problem The breadth-first search uses a queue to hold all expanded nodes.

5-1 Chapter 5 Tree Searching Strategies. 5-2 Breadth-first search (BFS) 8-puzzle problem The breadth-first search uses a queue to hold all expanded nodes.

Similar presentations

Ads by Google