1 / 35

Greedy Approximation with Non- submodular Potential Function

Greedy Approximation with Non- submodular Potential Function. Ding-Zhu Du. Chapter 2. Greedy Strategy. III. Nonsubmodular Potential Function. Connected Dominating Set. Given a graph, find a minimum node-subset such that

kcarla
Download Presentation

Greedy Approximation with Non- submodular Potential Function

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. Greedy Approximation with Non-submodular Potential Function Ding-Zhu Du

  2. Chapter 2. Greedy Strategy III. Nonsubmodular Potential Function

  3. Connected Dominating Set Given a graph, find a minimum node-subset such that • each node is either in the subset or adjacent to a node in the subset and • subgraph induced by the subset is connected.

  4. History • Two stage Greedy (ln Δ +3)-approximation (Guha & Khullar, 1998) where Δ is the maximum degree in input graph. • There is no polynomial time approximation with performance ratio (1-a) lnΔ unless NP in DTIME(n^{log log n}) for any a > 0. • Now, we show that there is a one-stage Greedy (1+a)(1+ln (Δ-1) )-approximation for any a > 0 with a nonsupmodular potential function.

  5. What’s the Potential Function? • f(A)=p(A)+q(A) • p(A) = # of connected components after adding edges incident to A (supmodular) • q(A) = # of connected components of the subgraph induced by A (nonsupmodular)

  6. Example p(circles)=1 q(circles)=2

  7. -p-q is not submodular x

  8. Background • There exist many greedy algorithms in the literature. • Some have theoretical analysis. But, most of them do not. • A greedy algorithm with theoretical analysis usually has a submodular potential function.

  9. Is it true? • Every previously known one-stage greedy approximation with theoretical analysis has a submodular (or supermodular) potential function. • Almost, only one exception which is about Steiner tree.

  10. How should we do with nonsubmodular functions?

  11. Find a space to play your trick

  12. Where is the space?

  13. Why the inequality true?

  14. Example • In a Steiner tree, all Steiner nodes form a dominating set. • In a full Steiner tree, all Steiner nodes form a connected dominating set.

  15. Observations • The submodularity has nothing to do with sequence chosen by the greedy algorithm. It is only about X1, …, Xopt • The ordering of X1, …, Xopt is free to choose.

  16. When f is nonsubmodular

  17. Idea • Organize optimal solution in such an ordering such that every prefix subsequence induces a connected subgraph, i.e., • For prefix subsequences A and B, Δxq(B)-Δxq(A) ≤ 1 for A supset of B

  18. Algorithm CDS1

  19. Connected Dominating Set Theorem. Algorithm CDS1 gives an (2+ ln Δ)-approximation, where Δ is the maximum node degree.

  20. Proof

  21. Connected Dominating Set Theorem. For any a >1, there is a a(1+ ln Δ)-approximation for the minimum connected dominating set, where Δ is the maximum node degree.

  22. Algorithm

  23. Analysis

  24. > k <k <k <k

  25. End Thanks!

More Related