1 / 2

Backtracking & Knapsack Algorithm Design - CSE 565 Lecture by A. Smith

Learn about backtracking algorithms, independent set concepts, knapsack problem solving, and analyzing recurrences. Discover how to design and analyze algorithms under the guidance of A. Smith. Includes solving recurrences and applying induction. Presented by A. Smith, referencing slides by E. Demaine, C. Leiserson, S. Raskhodnikova, K. Wayne.

herrod-horne
Télécharger la présentation

Backtracking & Knapsack Algorithm Design - CSE 565 Lecture by A. Smith

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. LECTURE 12 • Backtracking • Independent Set • Knapsack Algorithm Design and Analysis CSE 565 Adam Smith A. Smith; based on slides by E. Demaine, C. Leiserson, S. Raskhodnikova, K. Wayne

  2. What We Covered • Backtracking algorithms • Independent Set • Knapsack • Solving recurrences of the form F(n)=aF(n-1) + bF(n-2) +…+ f(n) • First step: Assume solution has form c^n • Solve for largest possible value for c • Verify guess by induction S. Raskhodnikova; based on slides by E. Demaine, C. Leiserson, A. Smith, K. Wayne

More Related