Browsing Mathematics (Faculty of) by Supervisor "Swamy, Chaitanya"
Now showing items 18 of 8

Algorithm Design for Ordinal Settings
(University of Waterloo, 20220829)Social choice theory is concerned with aggregating the preferences of agents into a single outcome. While it is natural to assume that agents have cardinal utilities, in many contexts, we can only assume access to the ... 
Approximation Algorithms for Clustering and Facility Location Problems
(University of Waterloo, 20170406)Facility location problems arise in a wide range of applications such as plant or warehouse location problems, cache placement problems, and network design problems, and have been widely studied in Computer Science and ... 
Approximation Algorithms for Distributionally Robust Stochastic Optimization
(University of Waterloo, 20190515)Twostage stochastic optimization is a widely used framework for modeling uncertainty, where we have a probability distribution over possible realizations of the data, called scenarios, and decisions are taken in two stages: ... 
The Capacitated Matroid Median Problem
(University of Waterloo, 20180518)In this thesis, we study the capacitated generalization of the Matroid Median Problem which is a generalization of the classical clustering problem called the kMedian problem. In the capacitated matroid median problem, ... 
Capacitated Network Design on Outerplanar Graphs
(University of Waterloo, 20200903)Network design problems model the efficient allocation of resources like routers, optical fibres, roads, canals etc. to effectively construct and operate critical infrastructures. In this thesis, we consider the capacitated ... 
Packing and Covering Odd (u,v)trails in a Graph
(University of Waterloo, 20160927)In this thesis, we investigate the problem of packing and covering odd $(u,v)$trails in a graph. A $(u,v)$trail is a $(u,v)$walk that is allowed to have repeated vertices but no repeated edges. We call a trail \emph{odd} ... 
Stochastic Minimum Norm Combinatorial Optimization
(University of Waterloo, 20220728)Motivated by growing interest in optimization under uncertainty, we undertake a systematic study of designing approximation algorithms for a wide class of 1stage stochasticoptimization problems with normbased objective ... 
Tolls For Atomic Congestion Games
(University of Waterloo, 20210226)In games where selfish players compete for resources, they often arrive at equilibria that are less desirable than the social optimum. To combat this inefficiency, it is common for some central authority to place tolls on ...