Consider the following problem. INPUT: Positive integers r1, ··· , rn and c1, ··· , cn . OUTPUT: An n by n matrix A with 0/1 entries such that for all i the sum of the ith row in A is ri and the sum of the ith column in A is ci , if such a matrix exists. Think of the problem this way. You want to put pawns on an n by n chessboard so that the ith row has ri pawns and the ith column has ci pawns. Consider the following greedy algorithm that constructs A row by row. Assume that the first i-1 rows have been constructed. Let aj be the number of 10 s in the jth column in the first i-1 rows. Now the ri columns with with maximum cj -aj are assigned 1’s in row i, and the rest of the columns are assigned 00 s. That is, the columns that still needs the most 1’s are given 1’s. Formally prove that this algorithm is correct using an exchange argument.
Consider the following problem. INPUT: Positive integers r1, ··· , rn and c1, ··· , cn . OUTPUT: An n by n matrix A with 0/1 entries such that for all i the sum of the ith row in A is ri and the sum of the ith column in A is ci , if such a matrix exists. Think of the problem this way. You want to put pawns on an n by n chessboard so that the ith row has ri pawns and the ith column has ci pawns. Consider the following greedy algorithm that constructs A row by row. Assume that the first i-1 rows have been constructed. Let aj be the number of 10 s in the jth column in the first i-1 rows. Now the ri columns with with maximum cj -aj are assigned 1’s in row i, and the rest of the columns are assigned 00 s. That is, the columns that still needs the most 1’s are given 1’s. Formally prove that this algorithm is correct using an exchange argument.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Consider the following problem.
INPUT: Positive integers r1, ··· , rn and c1, ··· , cn .
OUTPUT: An n by n matrix A with 0/1 entries such that for all i the sum of the ith row
in A is ri and the sum of the ith column in A is ci , if such a matrix exists.
Think of the problem this way. You want to put pawns on an n by n chessboard so that the
ith row has ri pawns and the ith column has ci pawns.
Consider the following greedy algorithm that constructs A row by row. Assume that the
first i-1 rows have been constructed. Let aj be the number of 10
s in the jth column in the
first i-1 rows. Now the ri columns with with maximum cj -aj are assigned 1’s in row i, and
the rest of the columns are assigned 00
s. That is, the columns that still needs the most 1’s
are given 1’s. Formally prove that this algorithm is correct using an exchange argument.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 7 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY