×
Get Full Access to Introduction To Algorithms - 3 Edition - Chapter 26 - Problem 26-3
Get Full Access to Introduction To Algorithms - 3 Edition - Chapter 26 - Problem 26-3

×

# Algorithmic consulting Professor Gore wants to open up an

ISBN: 9780262033848 130

## Solution for problem 26-3 Chapter 26

Introduction to Algorithms | 3rd Edition

• Textbook Solutions
• 2901 Step-by-step solutions solved by professors and subject experts
• Get 24/7 help from StudySoup virtual teaching assistants

Introduction to Algorithms | 3rd Edition

4 5 1 425 Reviews
24
4
Problem 26-3

Algorithmic consulting Professor Gore wants to open up an algorithmic consulting company. He has identified n important subareas of algorithms (roughly corresponding to different portions of this textbook), which he represents by the set A D fA1; A2;:::;Ang. In each subarea Ak, he can hire an expert in that area for ck dollars. The consulting company has lined up a set J D fJ1; J2;:::;Jmg of potential jobs. In order to perform job Ji, the company needs to have hired experts in a subset Ri A of subareas. Each expert can work on multiple jobs simultaneously. If the company chooses to accept job Ji , it must have hired experts in all subareas in Ri , and it will take in revenue of pi dollars. Professor Gores job is to determine which subareas to hire experts in and which jobs to accept in order to maximize the net revenue, which is the total income from jobs accepted minus the total cost of employing the experts. Consider the following flow network G. It contains a source vertex s, vertices A1; A2;:::;An, vertices J1; J2;:::;Jm, and a sink vertex t. For k D 1; 2 : : : ; n, the flow network contains an edge .s; Ak/ with capacity c.s; Ak/ D ck, and for i D 1; 2; : : : ; m, the flow network contains an edge .Ji;t/ with capacity c.Ji;t/ D pi. For k D 1; 2; : : : ; n and i D 1; 2; : : : ; m, if Ak 2 Ri, then G contains an edge .Ak; Ji/ with capacity c.Ak; Ji/ D 1. a. Show that if Ji 2 T for a finite-capacity cut .S; T / of G, then Ak 2 T for each Ak 2 Ri. b. Show how to determine the maximum net revenue from the capacity of a minimum cut of G and the given pi values. c. Give an efficient algorithm to determine which jobs to accept and which experts to hire. Analyze the running time of your algorithm in terms of m, n, and r D Pm iD1 jRij.

Step-by-Step Solution:
Step 1 of 3

Wednesday, January 21, 2015 12:02 PM 13.5 Page 1 13.5 Page 2 13.5 Page 3 13.5 Page 4 13.5 Page 5 13.5 Page 6 Friday, January 23, 2015 12:00 PM 13.6 Page 1 13.6 Page 2 13.6 Page 3 13.6 Page 4 13.6 Page 5

Step 2 of 3

Step 3 of 3

##### ISBN: 9780262033848

Introduction to Algorithms was written by and is associated to the ISBN: 9780262033848. The full step-by-step solution to problem: 26-3 from chapter: 26 was answered by , our top Engineering and Tech solution expert on 11/10/17, 05:55PM. This full solution covers the following key subjects: capacity, jobs, experts, Company, subareas. This expansive textbook survival guide covers 35 chapters, and 151 solutions. The answer to “Algorithmic consulting Professor Gore wants to open up an algorithmic consulting company. He has identified n important subareas of algorithms (roughly corresponding to different portions of this textbook), which he represents by the set A D fA1; A2;:::;Ang. In each subarea Ak, he can hire an expert in that area for ck dollars. The consulting company has lined up a set J D fJ1; J2;:::;Jmg of potential jobs. In order to perform job Ji, the company needs to have hired experts in a subset Ri A of subareas. Each expert can work on multiple jobs simultaneously. If the company chooses to accept job Ji , it must have hired experts in all subareas in Ri , and it will take in revenue of pi dollars. Professor Gores job is to determine which subareas to hire experts in and which jobs to accept in order to maximize the net revenue, which is the total income from jobs accepted minus the total cost of employing the experts. Consider the following flow network G. It contains a source vertex s, vertices A1; A2;:::;An, vertices J1; J2;:::;Jm, and a sink vertex t. For k D 1; 2 : : : ; n, the flow network contains an edge .s; Ak/ with capacity c.s; Ak/ D ck, and for i D 1; 2; : : : ; m, the flow network contains an edge .Ji;t/ with capacity c.Ji;t/ D pi. For k D 1; 2; : : : ; n and i D 1; 2; : : : ; m, if Ak 2 Ri, then G contains an edge .Ak; Ji/ with capacity c.Ak; Ji/ D 1. a. Show that if Ji 2 T for a finite-capacity cut .S; T / of G, then Ak 2 T for each Ak 2 Ri. b. Show how to determine the maximum net revenue from the capacity of a minimum cut of G and the given pi values. c. Give an efficient algorithm to determine which jobs to accept and which experts to hire. Analyze the running time of your algorithm in terms of m, n, and r D Pm iD1 jRij.” is broken down into a number of easy to follow steps, and 354 words. Since the solution to 26-3 from 26 chapter was answered, more than 825 students have viewed the full step-by-step answer. This textbook survival guide was created for the textbook: Introduction to Algorithms, edition: 3.

#### Related chapters

Unlock Textbook Solution