1 / 6

PTAS(Polynomial Time Approximation Scheme) cont.

PTAS(Polynomial Time Approximation Scheme) cont. Prepared by, Umair S. March 25 th , 2009. PTAS vs FPTAS. PTAS requires the complexity of an algorithm to be polynomial in terms of input size n for a fixed approximation factor є

meena
Télécharger la présentation

PTAS(Polynomial Time Approximation Scheme) cont.

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. PTAS(Polynomial Time Approximation Scheme) cont. Prepared by, Umair S. March 25th, 2009

  2. PTAS vs FPTAS • PTAS requires the complexity of an algorithm to be polynomial in terms of input size n for a fixed approximation factor є • FPTAS requires the complexity of an algorithm to be polynomial, both in terms of n as well as 1/є

  3. Designing Polynomial Time Approximation Scheme for Sub-set Sum Problem • Input • Output

  4. Designing Polynomial Time Approximation Scheme for Sub-set Sum Problem • In case of approximation, we are interested in a S’ such that • We define, Libe the set of numbers that are sum of all elements in each possible subsets of set Si where, Si is a set of first ith elements in set S. Then,

  5. Designing Polynomial Time Approximation Scheme for Sub-set Sum Problem • Pseudo-code for finding the closest sub-sum can be • While i<n • Remove where, lj is any element in set Li • end while • Solution: last element of Ln • Complexity: O(nW)

  6. Designing Polynomial Time Approximation Scheme for Sub-set Sum Problem • Complexity is O(nW), W can be exponential in the worst-case! • Consider small intervals instead of exact values in Li? • Equally spaced vs expanding intervals? • Possible to maintain an approximation factor? To be cont. in next lecture…

More Related