![]() ![]() Polynomial constant factor approximations using linear programming relaxation The greedy algorithm selects only 1 interval from group #1, while an optimal scheduling is to select from group #2 and then from group #1. For example, in the following instance of GISMP2: ![]() Continue until the set of candidate intervals is empty.Ī formal explanation is given by a Charging argument.Remove x, and all intervals intersecting x, and all intervals in the same group of x, from the set of candidate intervals.Select the interval, x, with the earliest finishing time.The following greedy algorithm finds a solution that contains at least 1/2 of the optimal number of intervals: This can be proved by showing an approximation-preserving reduction from MAX 3-SAT-3 to GISMP2. ![]() Moreover, it is MaxSNP-complete, i.e., it does not have a PTAS unless P=NP. A subset of intervals is compatible if no two intervals overlap. For instance, task A might run from 2:00 to 5:00, task B might run from 6:00 to 8:00 and task C might run from 9:00 to 10:00. Each task is represented by an interval describing the time in which it needs to be executed. Interval scheduling is a class of problems in computer science, particularly in the area of algorithm design. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |