1 / 18

Advanced Approximation Algorithms I

Advanced Approximation Algorithms I. Weighted Vertex Cover Set Cover Coloring 3-colorable Graphs. Weighted Vertex Cover. Given an undirected graph G=(V,E) and vertex weights w:V->R , find subset S of V such that and is as small as possible. Weighted Vertex Cover. 2. 2. 4.

nyla
Download Presentation

Advanced Approximation Algorithms I

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. Advanced Approximation AlgorithmsI WeightedVertex Cover Set Cover Coloring 3-colorable Graphs

  2. WeightedVertex Cover • Given an undirectedgraph G=(V,E) and vertexweightsw:V->R, find subset S of V such that and is as small as possible.

  3. WeightedVertex Cover 2 2 4 7

  4. Vertex Cover is NP-hard • Reduction from 3SAT.

  5. PricingMethod • Introduce a ”price” for eachedgeijdenotedpij. • Postulate a fairnesscriteria for eachvertex i: Ifequalityholdswesay that vertex i is tight.

  6. Algorithm • Set all pricespij to zero. • Whilethereexistssomeedgeijwhoseendpointsaren’t tight, increase the pricepijuntilone of them is. • Output the set of tight vertices as the vertex cover.

  7. CorrectnessAnalysis • Claim: The tight vertices form a vertex cover S.

  8. Approximation Guarantee • Fairness lemma: For everyvertex cover S and all fair pricespij it holds that Proof:

  9. Approximation Guarantee

  10. Set Cover Family of m subsets of the universe Universe of n elements

  11. Set Cover is NP-hard • Reduction from vertex cover. Wefound 2-approximation for vertex cover, weshould be able to find 2-approximation for set cover? Wrong!

  12. Algorithm • Repeatedly, greedilyadd the subset to the approximation solution that covers as many as possible of the universe elements not covered so far.

  13. Example

  14. Analysis • Let ni be the number of elements in the universe not covered by the i:th first chosen sets in the worstcase. • Clearly n0=n. • Let k* denote the optimum. • n1<=n0-n0/k* • ni+1<=ni-ni/k* • nk<=n(1-1/k*)k • Wewant nk<1 |=> k = k* ln n

  15. Coloring 3-colorable Graphs

  16. 3-Coloring is NP-hard • Reduction from Not-All-Equal-3SAT (NAESAT)

  17. Algorithm • As long as there is a vertex of degree >=sqrt(n), usetwo new colors to coloritsneighborhood. Remove the coloredneighborhood from the graph. • Usegreedycoloring on the remaininggraph.

  18. Analysis • Step one is run at mostsqrt(n) timesintroducingtwo new colorseach time. • Step twoadds at mostsqrt(n) new colors. • In total O(sqrt(n)) colors!

More Related