PhD Seminar • Algorithms and Complexity — A Local Search Framework for Experimental Design
Please note: This PhD seminar will be given online.
Hong Zhou, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Lap Chi Lau
In this talk, we will present a local search framework to design and analyze both combinatorial algorithms and rounding algorithms for experimental design problems. This framework provides a unifying approach to match and improve all known results in D/A/E-design and to obtain new results in previously unknown settings.