Consider the max-flow problem

Reference no: EM131121982

Consider the max-flow problem of Fig. 7.18.

(a) Apply the preflow-push algorithm with initial prices p1 = 0, and pi = N -i for i = 2,...,N. Use two different methods to choose the node for iteration: (1) Select the node with highest price, and (2) Select the node with lowest price. Explain why the first method works better, and speculate on the reason why this might be true in general.

(b) Write a computer program to solve the problem of Fig. 7.18 using the preflow-push algorithm with initial prices p1 = N and pi = 0 for i = 2,...,N. Use two different methods to choose the node for iteration: (1) Select the node with highest price, and (2) Select the node at random with equal probability among the possible choices. Plot the number of iterations required with the two methods as a function of N, starting with N = 1000 and up to some reasonable number. Can you make any experimental inferences about computational complexity

Reference no: EM131121982

Questions Cloud

Describe the players involved in the fusion center : Describe the players involved in the fusion center. Then, list the pros and cons of the Organized Crime Drug Enforcement Task Forces Fusion Center.

The balances for the accounts listed below : The balances for the accounts listed below appear in the Adjusted Trial Balance columns of the end-of-period spreadsheet (work sheet). Indicate whether each balance should be extended to

What are three goals of community-based corrections : Identify and describe at least three types of community-based corrections available in your state, such as probation, intermediate sanctions, parole, and reentry programs.

Creating and maintaining value and on the building blocks : Two questions based upon the content of the PowerPoint presentations on creating and maintaining value and on the building blocks of competencies: How would using systems thinking help administrators Create and maintain value in their operations

Consider the max-flow problem : (a) Apply the preflow-push algorithm with initial prices p1 = 0, and pi = N -i for i = 2,...,N. Use two different methods to choose the node for iteration: (1) Select the node with highest price, and (2) Select the node with lowest price. Explain ..

Transactions are analyzed and recorded in the journal : From the following list of steps in the accounting cycle, identify what two steps are missing.

Show that the method is equivalent to dijkstra''s algorithm : In particular, each augmentation uses a shortest path from the origin to some destination, the augmentations are done in the order of the destinations' proximity to the origin, and upon termination, p1 -pi gives the shortest distance from 1 to eac..

Auction algorithm applied to assignment problems : Consider the auction algorithm applied to assignment problems with benefits in the range [0, C], starting with zero prices.

What are the major factors that influence the effective cost : What are the major factors that influence the effective cost of a term loan?

User Account

All Pages