1 / 53

# Chapter 2. Greedy Strategy - PowerPoint PPT Presentation

Chapter 2. Greedy Strategy. II. Submodular function. Min Set Cover. Given a collection C of subsets of a set E , find a minimum subcollection C’ of C such that every element of E appears in a subset in C’. What is a submodular function?.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about 'Chapter 2. Greedy Strategy' - dmitri

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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

II. Submodular function

Given a collection C of subsets of a set E, find a minimum subcollection C’ of C such that every element of E appears in a subset in C’ .

Consider a function f on all subsets of a set E.

f is submodular if

for all subsets A, B of E.

{ Use f(C) as the potential function}

Greedy Algorithm produces an approximation within ln  +1 from optimal,

where = max S C |S| .

Equivalent to Submodularity

This inequality holds if and only if f is submodular and

(monotone increasing)

Meaning of Submodularity

• The earlier, the better!

• Monotone decreasing gain!

Greedy Algorithm produces an approximation within ln  +1 from optimal.

The same result holds for min weighted set-cover.

Given a collection C of subsets of a set E and a weight function w on C, find a minimum total-weight subcollection C’ of C such that every element of E appears in a subset in C’ .

Remark:

submodularity of f .

By the greedy strategy:

By the submodularity and mono increasing:

• Given a vertex-weighted graph G = (V,E), find a vertex cover of the min weight.

• Potential Function: f(A) = the number of edges covered by vertices in A.

• f is submodular:

f(A) + f(B) – f(A U B) is the number of edges covered by both A and B, and hence >f(A ∩B).

• Given a vertex-weighted hypergraph H = (V,C), find a hitting set A of the min total weight.

(In a hypergraphH = (V,C), C is a collection of subsets

of V. Also, a hitting set is a subset of V that

intersects each set in C.)

• f(A) [= the number of subsets in C that intersects A] is submodular.

• Given m subsets X1, …, Xm of set X, find a graph G with vertex set X and minimum number of edges such that for every i=1, …, m, the subgraph G[Xi] induced by Xi is connected.

Weighted version

Minimize the total edge weight in G.

For any edge set A, define fi(A) to be the number of connected components of the subgraph of (X,A), induced by Xi.

Function– fi is submodular.

Consider two edge sets A and B.

Observe that if an edge in A connects two connected

components of G [B] into one component of G [AUB],

Then this edge also connects two components of

G [AB into one component of G [A].

So, f (B) – f (A U B)

= # of components of G [B] reduced by edges in A

< # of components of G [AB] reduced by edges in A

= f (AB) – f (A).

• All acyclic subgraphs form a matroid.

• The rank of a subgraph is the cardinality of a maximum independent subset of edges in the subgraph.

• Let Ei = {(u,v) in E | u, v in Xi}.

Rank ri(E)=ri(Ei)=|Xi| – fi(E).

• Rank riis submodular.

Proof. Consider two independent subsets A, B.

Let I 1 be a maximal indep set in AB, I 2 a

maximal indep set in A that contains I 1, and

I 3 a maximal indep set in AUB that contains I 2.

Since (E,C) is a matroid,

|I 1|=rank(AB), |I 2|=rank(A), |I 3|=rank(AUB).

Let J = I 3 – I 2. From the maximality of I 2, we

know that J is a subset of B. Therefore, I 1UJ

is an indep set in B, |I 1|+|J| < rank(B);

or,

rank(AB) +rank(AUB) – rank(A) < rank(B).

Potential Function r1+ּּּ+rm

Theorem Subset Interconnection Design has a (1+ln m)-approximation.

r1(Φ)+ּּּ+rm(Φ)=0

r1(e)+ּּּ+rm(e)<m for any edge

• Given a connected graph, find a minimum vertex-cover which induces a connected subgraph.

For any vertex subset A, h(A) is the number of connected components of the subgraph induced by A.

– g is submodular (same as in Min-WVC)

– ug(C) = |N(u) – C|= number of neighbors

of u that are not in C

• covered by A.h is not submodular.

• – u h(C) = [number of connected components in G|C subgraph induced by C that are adjacent to u] – 1

• In the following, A a subset of B but

– u h(A) < – u h(B)

A B

covered by A.g – h is submodular

We prove this by a new characterization of submodularity:

f is submodular (and monotone increasing)

iff for all A, x, y,

where =

p(C) = – g(C) – h(C) covered by A.: v up(C) <0

Case 1. u = v.

•  v up(C) <0 iff up(C) >0

• If u is not adjacent to any x in C, then

– ug(C) = deg(u). – uh(C) = –1

and so up(C) >0 because deg(u) > 1.

• If u is adjacent to some x in C, then

– uh(C) >0

Case 2. u is not adjacent to v covered by A.

Case 3. u is adjacent to v

Theorem covered by A.

• Connected Vertex-Cover has a (1+ln Δ)-approximation.

–g(Φ) = –|E|, – h(Φ) = 0.

|E|– g(x) – h(x) <Δ – 1

Δ is the maximum degree.

Theorem covered by A.

• Connected Vertex-Cover has a 3-approximation.

Need at most |M|-1 vertices to connect a

matching M.

Weighted Connected Vertex-Cover covered by A.

Given a vertex-weighted connected graph,

find a connected vertex-cover with minimum

total weight.

TheoremWeighted Connected Vertex-Cover

has a (1+ln Δ)-approximation.

This is the best-possible!!!