1 / 27

Lecture 28 Approximation of Set Cover

Lecture 28 Approximation of Set Cover. Min Set Cover. Red + Green. Greedy Algorithm. Observation. Theorem. Theorem. Greedy Algorithm produces an approximation within ln n +1 from optimal. The same result holds for weighted set-cover. Theorem. Proof. Hierarchy of Approximation.

annettehines
Télécharger la présentation

Lecture 28 Approximation of Set Cover

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 28Approximation of Set Cover

  2. Min Set Cover Red + Green

  3. Greedy Algorithm

  4. Observation

  5. Theorem

  6. Theorem Greedy Algorithm produces an approximation within ln n +1 from optimal. The same result holds for weighted set-cover.

  7. Theorem Proof.

  8. Hierarchy of Approximation

  9. Theorem Proved using PCP system

  10. MCDS Theorem (Guha-Khuller, 1998)

  11. NP=P!

  12. NP=P!

  13. Connected Vertex-Cover • Given a connected graph, find a minimum vertex-cover which induces a connected subgraph.

  14. Theorem • Connected Vertex-Cover has a 3-approximation.

  15. Weighted Connected Vertex-Cover Given a vertex-weighted connected graph, find a connected vertex-cover with minimum total weight. TheoremWeighted Connected Vertex-Cover has a (1+ln Δ)-approximation where Δ is the maximum node degree of input graph. This is the best-possible!!!

  16. Theorem

  17. NP=P!

  18. NP=P!

More Related