Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Consider the following minimize gaps interval scheduling problem: Given is a global start time S and finish time F. Given also is a set of

image text in transcribed

Consider the following "minimize gaps" interval scheduling problem: Given is a global start time S and finish time F. Given also is a set of n intervals where the i-th interval starts at time si and ends at time fi, s 0 is the smallest possible. Select both intervals and discard overlapping intervals. Recursively do the same selection process with intervals that finish at or before si: the recursive call will have Snew = S and Fnew = si. Similarly, recursively do the same selection process with intervals that start at or after fj: now Snew = f; and Fnew = F. If there is no such pair of intervals, select a single interval that minimizes the gap between S and F (do not make any further recursive calls). None of these strategies works all the time. Find a counterexample for each strategy. In other words, for each strategy, find a set of intervals and S and F so that the strategy does not produce an optimal solution, highlight intervals selected by the strategy and state the corresponding gap time, and highlight intervals in an optimal solution (one that minimizes the overall gap time) and state the corresponding gap time. Consider the following "minimize gaps" interval scheduling problem: Given is a global start time S and finish time F. Given also is a set of n intervals where the i-th interval starts at time si and ends at time fi, s 0 is the smallest possible. Select both intervals and discard overlapping intervals. Recursively do the same selection process with intervals that finish at or before si: the recursive call will have Snew = S and Fnew = si. Similarly, recursively do the same selection process with intervals that start at or after fj: now Snew = f; and Fnew = F. If there is no such pair of intervals, select a single interval that minimizes the gap between S and F (do not make any further recursive calls). None of these strategies works all the time. Find a counterexample for each strategy. In other words, for each strategy, find a set of intervals and S and F so that the strategy does not produce an optimal solution, highlight intervals selected by the strategy and state the corresponding gap time, and highlight intervals in an optimal solution (one that minimizes the overall gap time) and state the corresponding gap time

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

XML Data Management Native XML And XML Enabled Database Systems

Authors: Akmal Chaudhri, Awais Rashid, Roberto Zicari, John Fuller

1st Edition

0201844524, 978-0201844528

More Books

Students also viewed these Databases questions