subject
Mathematics, 18.11.2019 19:31 pippalotta

Let p = {p1, p2, · · · , pn} be a set of points on the x axis with each point pi , 1 ≤ i ≤ n, represented by its coordinates. design a greedy algorithm to find a minimum number of intervals with unit length on the x axis to cover the set of points in p, where a point pi is covered by an interval if its x coordinate falls in the interval. for each interval you need to determine its position (i. e., its starting and ending points). prove the correctness of your algorithm. now suppose that the points in p are located on a 2d plane and each interval becomes an axis-aligned unit square. prove or disprove whether your greedy strategy for the 1-d case can still be extended to the 2-d case. for proving it works, you need to clear state how the greedy strategy is extended to 2d and prove its correctness. for disproving it, you just need to give a counter example.

ansver
Answers: 1

Other questions on the subject: Mathematics

image
Mathematics, 21.06.2019 19:50, LilXan420
If your teacher tells you to do questions 6 through 19 in your math book for homework, how many questions is that
Answers: 1
image
Mathematics, 21.06.2019 21:30, baltazmapa629n
The length of a field is 100 yards and its width is 75 yards. if 1 inch represents 25 yards, what would be the dimensions of the field drawn on a sheet of paper?
Answers: 1
image
Mathematics, 22.06.2019 03:00, PearlJam5492
What is the answer to question 11? will give extra points! include a explanation (reasonable) for you : )
Answers: 2
image
Mathematics, 22.06.2019 04:00, dmckinnies8
30 points if you answer all 3 questions with work!
Answers: 1
You know the right answer?
Let p = {p1, p2, · · · , pn} be a set of points on the x axis with each point pi , 1 ≤ i ≤ n, repres...

Questions in other subjects:

Konu
Mathematics, 18.10.2020 07:01