This question is very similar to meeting rooms 2,which is equivalent to given a interval set, find minimum rooms to hold all the intervals. Like that question, we can use the greedy algorithm to solve it. But n
This completes the proof. 6.3.2 Four offline and online scheduling algorithms We propose four offline and online scheduling algorithms as follows: [Definition 5. Modified Interval Partitioning First-Fit Algorithm (MFF)]. The algorithm places the requests in arbitrary order. It attempts to place ...
Interval Scheduling
Since split graphs are chordal one cannot expect to extend a greedy type algorithm to chordal graphs for (P2), (unless one finds a greedy algorithm for matching problems). In fact polynomiality of (P2) and Theorem 5 can be proved in chordal graphs using a canonical simplicial decomposition ...
We prove that, in games in which all the guards move at the same turn, the eternal domination and the clique-connected cover numbers coincide for interval graphs. A linear algorithm for the eternal dominating set problem on interval graphs is obtained as a by-product. ...