Scribd
Upload
3 views2 pages

Assign 2

Uploaded by

Prasoon bajpai
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views2 pages

Assign 2

Uploaded by

Prasoon bajpai
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment 2

Due date: August 30, 2018.

1. Suppose G is a directed weighted complete graph. Let the weights of edges of G


satisfy the following triangle inequality: for any three edges (i, j), (j, k), and (i, k)
we have w(i, j) + w(j, k) ≥ w(i, k). Show that a potential of G exists if and only if
w(i, j) + w(j, i) ≥ 0.

2. Find a feasible solution or determine that there are no feasible solutions for the following
system of difference inequalities.

x1 − x2 ≤ 4
x1 − x5 ≤ 5
x2 − x4 ≤ −6
x3 − x2 ≤ 1
x4 − x1 ≤ 3
x4 − x3 ≤ 5
x4 − x5 ≤ 10
x5 − x3 ≤ −4
x5 − x4 ≤ −8.

3. Suppose G = (N, E, w) is a strongly connected digraph which has no cycle of negative


length. Let p be a potential of G such that p(i) = 0 and p(j) = s(i, j) for all j ∈ N \{i},
where s(i, j) is the shortest path from i to j in G. Let q be any other potential of G
such that q(i) = 0. Show that p(j) ≥ q(j) for all j ∈ N .

4. Suppose G = (N, E, w) is strongly connected digraph which has no cycle of negative


length. Suppose G satisfies the following property: for every cut (S, N \ S) of G, there
exists i ∈ S and j ∈ N \ S such that w(i, j) + w(j, i) = 0. Show that G satisfies
potential equivalence.

5. Consider the flow graph in Figure 1. Compute the maximum flow of this flow graph
using two approaches (both approaches run Ford-Fulkerson algorithm but asks you to
pick a path from s to t in the residual graph in a particular way if there are more than
one such path):

• In the first approach, always pick an augmenting path from s to t in the residual
graph which has the maximum number of edges.

1
• In the second approach, always pick an augmenting path from s to t in the residual
graph which has the minimum number of edges.

Compare the number of iterations of Ford-Fulkerson algorithm in both approaches.

1000
1000

1
s t

1000 1000

Figure 1: Maximum flow in a flow graph

6. Let G = (N, E, c) be a flow graph and f be a feasible flow of this flow graph. Assume
that c : E → Z+ (integer capacities) and f : E → R+ (real flow). Show that there
exists another feasible flow f 0 of this flow graph such that ν(f 0 ) = dν(f )e and f 0 (i, j) ∈
{bf (i, j)c, df (i, j)e} for all (i, j) ∈ E.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy