# Prove that the algorithm from Exercise 44 is a 2-

## Problem 46E Chapter 3.SE

Discrete Mathematics and Its Applications | 7th Edition

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

Discrete Mathematics and Its Applications | 7th Edition

4 5 0 403 Reviews
12
2
Problem 46E

Prove that the algorithm from Exercise 44 is a 2- approximation algorithm for the load balancing problem. [Hint: Use both parts of Exercise 43.]Exercise 44: Write out in pseudo code the greedy algorithm that goes through the jobs in order and assign each job to the processor with the smallest load at that point in the algorithm.Exercise 43: Suppose that L* is the minimum makespan when p processors are given n jobs, where tj is the time required to run job j.1. Show that L* maxj = 1,2,….,n tj2. Show that L*

Step-by-Step Solution:
Step 1 of 3

Leslie Ogu CSCI 4531 09/06/2016 ­ ​Chapter 2: Encryption Symmetric Encryption + The universal technique for providing confidentiality for transmitted or stored data + Also referred to as conventional encryption or ​single­key encryption + Two requirements to use: + Need a strong encryption algorithm...

Step 2 of 3

Step 3 of 3

##### ISBN: 9780073383095

This full solution covers the following key subjects: Algorithm, exercise, hint, both, Approximation. This expansive textbook survival guide covers 101 chapters, and 4221 solutions. The full step-by-step solution to problem: 46E from chapter: 3.SE was answered by , our top Math solution expert on 06/21/17, 07:45AM. Since the solution to 46E from 3.SE chapter was answered, more than 235 students have viewed the full step-by-step answer. The answer to “Prove that the algorithm from Exercise 44 is a 2- approximation algorithm for the load balancing problem. [Hint: Use both parts of Exercise 43.]Exercise 44: Write out in pseudo code the greedy algorithm that goes through the jobs in order and assign each job to the processor with the smallest load at that point in the algorithm.Exercise 43: Suppose that L* is the minimum makespan when p processors are given n jobs, where tj is the time required to run job j.1. Show that L* maxj = 1,2,….,n tj2. Show that L*” is broken down into a number of easy to follow steps, and 92 words. This textbook survival guide was created for the textbook: Discrete Mathematics and Its Applications, edition: 7th. Discrete Mathematics and Its Applications was written by and is associated to the ISBN: 9780073383095.

#### Related chapters

×
Get Full Access to Discrete Mathematics And Its Applications - 7th Edition - Chapter 3.se - Problem 46e

Get Full Access to Discrete Mathematics And Its Applications - 7th Edition - Chapter 3.se - Problem 46e

I don't want to reset my password

Need help? Contact support

Need an Account? Is not associated with an account
We're here to help