Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
A group of n people are lying on the beach. The beach is represented by the real line R and the location of the i-th person is some integer x; € Z. Your task is to prevent people from getting sunburned by covering them with umbrellas. Each umbrella corresponds to a closed interval I = [a, a+ L] of length Le N, and the i-th person is covered by that umbrella if r; e I. Design a greedy algorithm for covering all people with the minimum number of umbrellas. The input consists of the integers x1,..., Xn, and L. The output of your algorithm should be the positions of umbrellas.

A group of n people are lying on the beach. The beach is represented by the real line R and the location of the i-th person is some integer x; € Z. Your task is to prevent people from getting sunburned by covering them with umbrellas. Each umbrella corresponds to a closed interval I = [a, a+ L] of length Le N, and the i-th person is covered by that umbrella if r; e I. Design a greedy algorithm for covering all people with the minimum number of umbrellas. The input consists of the integers x1,..., Xn, and L. The output of your algorithm should be the positions of umbrellas.

Computer Networking: A Top-Down Approach (7th Edition)
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...
See similar textbooks
icon
Related questions
Question
Computer science
group of n people are lying on the beach. The beach is represented by the real line R and the location of the i-th person is some integer x; e Z. Your task is to prevent people from getting sunburned by covering them with umbrellas. Each umbrella corresponds to a closed interval I = [a, a+ L] of length Le N, and the i-th person is covered by that umbrella if r; e I. Design a greedy algorithm for covering all people with the minimum number of umbrellas. The input consists of the integers x1,..., Xn, and L. The output of your algorithm should be the positions of umbrellas. A For example, if the input is x1 = 1, x2 = 3, x3 = 5, and L = 2, then an optimum solution is the set of two umbrellas placed at positions 2 and 5, covering intervals [1,3] and [4, 6]. %3D %3! %3D 3 4 5 6 1 2 The running time of your algorithm should be polynomial in n.
Transcribed Image Text:group of n people are lying on the beach. The beach is represented by the real line R and the location of the i-th person is some integer x; e Z. Your task is to prevent people from getting sunburned by covering them with umbrellas. Each umbrella corresponds to a closed interval I = [a, a+ L] of length Le N, and the i-th person is covered by that umbrella if r; e I. Design a greedy algorithm for covering all people with the minimum number of umbrellas. The input consists of the integers x1,..., Xn, and L. The output of your algorithm should be the positions of umbrellas. A For example, if the input is x1 = 1, x2 = 3, x3 = 5, and L = 2, then an optimum solution is the set of two umbrellas placed at positions 2 and 5, covering intervals [1,3] and [4, 6]. %3D %3! %3D 3 4 5 6 1 2 The running time of your algorithm should be polynomial in n.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
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
SEE MORE TEXTBOOKS