1 / 27

Approximation Problems

Approximation Problems. Network Power. VERTEX-COVER. Optimization. Approximation. VC - Approximation Algorithm. COR(B) 523-524. Mass Mailing. SET-COVER. SET-COVER NP-Hard. SC. VC. COR(B) 530-533. The Greedy Algorithm. How to prove an Approximation Ratio?. l g 2 n. l n n.

germane-blevins
Télécharger la présentation

Approximation Problems

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. Approximation Problems

  2. Network Power

  3. VERTEX-COVER

  4. Optimization

  5. Approximation

  6. VC - Approximation Algorithm COR(B) 523-524

  7. Mass Mailing

  8. SET-COVER

  9. SET-COVER NP-Hard SC VC

  10. COR(B) 530-533 The Greedy Algorithm

  11. How to prove an Approximation Ratio?

  12. lg2 n

  13. ln n

  14. Best Ratio-Bound

  15. Traveling Salesperson Problem 1 3 2 4 4 3

  16. Approximation Algorithm COR(B) 525-527 

  17. gap-TSP

  18. gap-TSP

  19. gap-TSP is NP-hard

  20. Synopsis

  21. WWindex

More Related