1 / 46

Chapter 35: Approximation Algorithms

Comp 750, Fall 2009. Approx Algs - 2. Definitions. An approximate algorithm has an approximation ratio of ?(n) iffor any input of size n, max(C/C*, C*/C) ? ?(n)where C = cost of solution produced by a.a. C* = cost of optimal solutionApplies to both minimization and maxim

roden
Download Presentation

Chapter 35: Approximation Algorithms

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. Comp 750, Fall 2009 Approx Algs - 1 Chapter 35: Approximation Algorithms Goal: Find near-optimal solutions to hard optimization problems. What does near-optimal mean? Need some definitions

    2. Comp 750, Fall 2009 Approx Algs - 2 Definitions

More Related