Combinatorics and Optimization
This is the collection for the University of Waterloo's Department of Combinatorics and Optimization .
Research outputs are organized by type (eg. Master Thesis, Article, Conference Paper).
Waterloo faculty, students, and staff can contact us or visit the UWSpace guide to learn more about depositing their research.
Recent deposits

Induced Binary Submatroids
(University of Waterloo, 20210721)The notion of induced subgraphs is extensively studied in graph theory. An example is the famous Gy\'{a}rf\'{a}sSumner conjecture, which asserts that given a tree $T$ and a clique $K$, there exists a constant $c$ such ... 
Fractional refinements of integral theorems
(University of Waterloo, 20210709)The focus of this thesis is to take theorems which deal with ``integral" objects in graph theory and consider fractional refinements of them to gain additional structure. A classic theorem of Hakimi says that for an ... 
Clifford Simulation: Techniques and Applications
(University of Waterloo, 20210528)Despite the widespread belief that quantum computers cannot be efficiently simulated classically, efficient simulation is known to be possible in certain restricted regimes. In particular, the GottesmanKnill theorem states ... 
Computing the Nucleolus of Matching and bMatching Games
(University of Waterloo, 20210521)In the classical weighted matching problem the optimizer is given a graph with edge weights and their goal is to find a matching which maximizes the sum of the weights of edges in the matching. It is typically assumed in ... 
Simple Termination Criteria for Stochastic Gradient Descent Algorithm
(University of Waterloo, 20210409)Stochastic gradient descent (SGD) algorithm is widely used in modern mathematical optimization. Because of its scalability and ease of implementation, SGD is usually preferred to other methods including the gradient descent ... 
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 ... 
Open Shortest Path First Routing Under Random Early Detection
(Wiley, 20180301)In this article, we consider a variant of Open Shortest Path First (OSPF) routing that accounts for Random Early Detection (RED), an Active Queue Management method for backbone networks. In the version of OSPF we consider ... 
Relaxations of the Maximum Flow Minimum Cut Property for Ideal Clutters
(University of Waterloo, 20210129)Given a family of sets, a covering problem consists of finding a minimum cost collection of elements that hits every set. This objective can always be bound by the maximum number of disjoint sets in the family, we refer ... 
Comparing Classical Portfolio Optimization and Robust Portfolio Optimization on Black Swan Events
(University of Waterloo, 20210129)Black swan events, such as natural catastrophes and manmade market crashes, historically have a drastic negative influence on investments; and there is a discrepancy on losses caused by these two types of disasters. In ... 
Craniosynostosis Surgery: A Study of Rearrangement
(University of Waterloo, 20201222)Cranial vault remodeling, a form of skull surgery is currently performed according to intuition developed over years of experience. The problem of how to best perform this surgery has not yet thoroughly been studied by ... 
Quantum Compression and Quantum Learning via Information Theory
(University of Waterloo, 20201221)This thesis consists of two parts: quantum compression and quantum learning theory. A common theme between these problems is that we study them through the lens of information theory. We first study the task of visible ... 
A Blueprint for Semidefinite Relaxations of BinaryConstrained Quadratic Programs Computing tight bounds on NPhard problems using ADMM
(University of Waterloo, 20201218)This thesis looks at the solution techniques of two NPhard, large scale problems, the quadratic assignment problem, QAP, and the side chain positioning, SCP, problem. We summarize existing approaches from and look at the ... 
The complexity of some setpartitioning formulations for the vehicle routing problem with stochastic demands
(University of Waterloo, 20201028)The capacitated vehicle routing problem with stochastic demands (CVRPSD) is a variant of the deterministic capacitated vehicle routing problem (CVRP). The CVRP consists of planning routes for vehicles with a given capacity ... 
On Combinatorics, Integrability and Puzzles
(University of Waterloo, 20201023)In the last decade, many old and new results in combinatorics have been shown using the theory of quantum integrable systems from particle physics. The key to solving such problems is the derivation of an underlying ... 
Sumofnorms clustering: theoretical guarantee and postprocessing
(University of Waterloo, 20200911)Sumofnorms clustering is a method for assigning n points in ddimensional real space to K clusters, using convex optimization. Recently, Panahi et al. proved that sumofnorms clustering is guaranteed to recover a mixture ... 
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 ... 
Augmenting Trees to Achieve 2NodeConnectivity
(University of Waterloo, 20200902)This thesis focuses on the NodeConnectivity Tree Augmentation Problem (NCTAP), formally defined as follows. The first input of the problem is a graph G which has vertex set V and edge set E. We require V >= 3 to avoid ... 
Smoothening Functions and the Homomorphism Learning Problem
(University of Waterloo, 20200902)This thesis is an exploration of certain algebraic and geometrical aspects of the Learning With Errors (LWE) problem introduced in Reg05. On the algebraic front, we view it as a Learning Homomorphisms with Noise problem, ... 
Sparsity in Critical Graphs with Small Clique Number
(University of Waterloo, 20200827)In 1998, Reed conjectured that for every graph $G$, $\chi(G) \leq \lceil \frac{1}{2}(\Delta(G)+1+\omega(G)) \rceil$, and proved that there exists $\varepsilon > 0$ such that $\chi(G) \leq \lceil (1  \varepsilon)(\Delta(G)+1) ... 
Noisy Interactive Quantum Communication
(University of Waterloo, 20200825)We consider the problem of implementing twoparty interactive quantum communication over noisy channels, a necessary endeavor if we wish to fully reap quantum advantages for communication. For an arbitrary protocol with n ...