Suppose that you are given a set T of projects where each project t T is associ- ated with • a positive integer e, denoting the amount of effort (e.g., the amount of time or energy) required to complete the project t, and • a positive integer p, denoting the profit gained by completing the project t. Given a positive integer c denoting the maximum amount of effort that you can spend on these projects, the goal is to find the largest amount of profit that you can make by completing a subset of these projects such that the total amount of effort spent to complete the projects is at most c. State the decision version of this optimization problem: Input? Output? Prove that the decision version is in NP.

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...
icon
Related questions
Question

please don't copy paste

Suppose that you are given a set T of projects where each project t € T' is associ-
ated with
• a positive integer e, denoting the amount of effort (e.g., the amount of time
or energy) required to complete the project t, and
• a positive integer pi denoting the profit gained by completing the project t.
Given a positive integer c denoting the maximum amount of effort that you can
spend on these projects, the goal is to find the largest amount of profit that you can
make by completing a subset of these projects such that the total amount of effort
spent to complete the projects is at most c.
State the decision version of this optimization problem: Input?
Output?
Prove that the decision version is in NP.
Transcribed Image Text:Suppose that you are given a set T of projects where each project t € T' is associ- ated with • a positive integer e, denoting the amount of effort (e.g., the amount of time or energy) required to complete the project t, and • a positive integer pi denoting the profit gained by completing the project t. Given a positive integer c denoting the maximum amount of effort that you can spend on these projects, the goal is to find the largest amount of profit that you can make by completing a subset of these projects such that the total amount of effort spent to complete the projects is at most c. State the decision version of this optimization problem: Input? Output? Prove that the decision version is in NP.
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY