Now showing items 1-8 of 8

    • Algorithm Design for Ordinal Settings 

      Pulyassary, Haripriya (University of Waterloo, 2022-08-29)
      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 

      Ahmadian, Sara (University of Waterloo, 2017-04-06)
      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 

      Linhares Rodrigues, Andre (University of Waterloo, 2019-05-15)
      Two-stage 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 

      Kalhan, Sanchit (University of Waterloo, 2018-05-18)
      In this thesis, we study the capacitated generalization of the Matroid Median Problem which is a generalization of the classical clustering problem called the k-Median problem. In the capacitated matroid median problem, ...
    • Capacitated Network Design on Outerplanar Graphs 

      Bansal, Ishan (University of Waterloo, 2020-09-03)
      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 

      Ibrahimpur, Sharat (University of Waterloo, 2016-09-27)
      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 

      Ibrahimpur, Sharat (University of Waterloo, 2022-07-28)
      Motivated by growing interest in optimization under uncertainty, we undertake a systematic study of designing approximation algorithms for a wide class of 1-stage stochastic-optimization problems with norm-based objective ...
    • Tolls For Atomic Congestion Games 

      Stoll, Alexander (University of Waterloo, 2021-02-26)
      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 ...


      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages