/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Q22E In a particular network G = (V, ... [FREE SOLUTION] | 91Ó°ÊÓ

91Ó°ÊÓ

In a particular network G = (V, E) whose edges have integer capacities ce, we have already found the maximum flow f from node to node t. However, we now find out that one of the capacity values we used was wrong: for edge (u, v) we used cuv whereas it should have been cuv. -1 This is unfortunate because the flow f uses that particular edge at full capacity: f = c.

We could redo the flow computation from scratch, but there’s a faster way. Show how a new optimal flow can be computed inO(|V|+|E|) time.

Short Answer

Expert verified

The flow that meets the new capacity restriction and has size F - 1. Under the new capacity limit, it has its optimal flow.

Step by step solution

01

Algorithm for finding the new optimal flow

  1. Let E' be the edges e∈E which F(e) > 0, and let G' = (V,E'). Find in G' a path P1 from s to u and a path P2 from v to t.
  2. [Special case: If P1 from P2 have some edge in common, then role="math" localid="1659793051037" e∈EP1∪u,v∪P2has a directed cycle containing (u,v). In this case, the flow along this cycle can be reduced by one unit without changing the size of the overall flow. Return the resulting flow.]
  3. Reduce flow by one unit along P1∪u,v∪P2.
  4. Run Ford-Fulkerson with this starting flow.
  5. Flow start base on reduce unit and changing size of overall flow.
02

Step  2: Justification and running time

This source circulation had size F, as evidenced by the explanation and running time. Let's overlook the unique circumstance (2).

We have a valid flow that fulfils the new capacity limit and has size F - 1 during step (3) of the procedure. Its ideal flow underneath the new capacity limit is then determined by step (4), Ford-Fulkerson.

Therefore, the stream is at most F, Ford-Fulkerson only runs for one iteration. Because each step is shorter, the overall running time is linear O(|V|+|E|).

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with 91Ó°ÊÓ!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

In a satisfiable system of linear inequalities

a11x1+···+a1nxn≤b1:am1x1+···+amnxn≤bm

we describe the inequality as forced-equal if it is satisfied with equality by every solution x = (x1,...,xn)of the system. Equivalently,Piajixi≤bj is not forced-equal if there exists an x that satisfies the whole system and such that Piajixi≤bj.

For example, in

x1+x2≤2-x1-x2≤-2x1≤1-x2≤0

There are many common variations of the maximum flow problem. Here are four of them.

(a) There are many sources and many sinks, and we wish to maximize the total flow from all sources to all sinks.

(b) Each vertex also has a capacity on the maximum flow that can enter it.

(c) Each edge has not only a capacity, but also a lower bound on the flow it must carry.

(d) The outgoing flow from each node u is not the same as the incoming flow, but is smaller by a factor of (1-∈U), whererole="math" localid="1659789093525" ∈u is a loss coefficient associated with node u.

Each of these can be solved efficiently. Show this by reducing (a) and (b) to the original max-flow problem, and reducing (c) and (d) to linear programming.

The pizza business in Little Town is split between two rivals, Tony and Joey. They are each investigating strategies to steal business away from the other. Joey is considering either lowering prices or cutting bigger slices. Tony is looking into starting up a line of gourmet pizzas, or offering outdoor seating, or giving free sodas at lunchtime. The effects of these various strategies are summarized in the following payoff matrix (entries are dozens of pizzas, Joey’s gain and Tony’s loss).




TONY




Gourmet

Seating

Freesoda

JOEY

Lower price

+2

0

-3


BiggerSlices

_1

-2

+1

For instance, if Joey reduces prices and Tony goes with the gourmet option, then Tony will lose 2 dozen pizzas worth of nosiness to Joey.

What is the value of this game, and what are the optimal strategies for Tony and Joey?

A quadratic programming problem seeks to maximize a quadratic objective function (with terms like 3x12or5x1x2) subject to a set of linear constraints. Give an example of a quadratic program in two variables x1, x2 such that the feasible region is nonempty and bounded, and yet none of the vertices of this region optimize the (quadratic) objective.

Suppose someone presents you with a solution to the max-flow problem on some network. Give a linear-time algorithm to determine whether the solution does indeed give a maximum flow.

See all solutions

Recommended explanations on Computer Science Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.