Algorithms and Complexity

I am also taking a topic course -- Algorithmic power tools, this semester taught by Professor Rajmohan Rajaraman⁷. At the first half semester, we mainly focus on studying Approximation Algorithms, Probabilistic Method, Lovasz Local Lemma, Entropy Compression Argument, Randomized/Deterministic Rounding, Linear Programming, Generalized Network Design. The next half semester, I will do a research project under the topic of ``Algorithms and complexity of periodic scheduling''. Papers I need to read include Eisenbrand, et.al.'s ``EDF-schedulability of synchronous periodic task systems is coNP-hard'' and Bonifaci, et.al.'s ``Algorithms and Complexity for Periodic Real-Time Scheduling''.