Seminars
View all Seminars | Download ICal for this eventCovering Problems in Network Design and Geometric Optimization
Series: Ph.D. Colloquium
Speaker: Aditya Subramanian, Ph.D (Engg.) student, Dept. of IISc
Date/Time: Mar 03 15:00:00
Location: CSA Auditorium, (Room No. 104, Ground Floor)
Faculty Advisor: Prof. Arindam Khan
Abstract:
Covering problems represent a fundamental paradigm in combinatorial optimization: how can we efficiently select a minimum-cost collection of resources to satisfy a set of requirements? These problems lie at the heart of many real-world applications, ranging from the design of fault-tolerant internet architectures to resource allocation in heterogeneous computing environments. This thesis explores this question across two distinct but mathematically interconnected domains: Fault-Tolerant Network Design and Computational Geometry. By addressing inputs characterized by uncertainty and dynamic changes, we contribute new algorithms and hardness results across online, dynamic, and approximation models. A recurring technical theme is the development of an
