Browsing Theses by Subject "Approximation Algorithms"
Now showing items 1-6 of 6
-
Algorithms for Geometric Covering and Piercing Problems
(University of Waterloo, 2013-01-10)This thesis involves the study of a range of geometric covering and piercing problems, where the unifying thread is approximation using disks. While some of the problems addressed in this work are solved exactly with ... -
Approximating Minimum-Size 2-Edge-Connected and 2-Vertex-Connected Spanning Subgraphs
(University of Waterloo, 2017-04-27)We study the unweighted 2-edge-connected and 2-vertex-connected spanning subgraph problems. A graph is 2-edge-connected if it is connected on removal of an edge, and it is 2-vertex-connected if it is connected on removal ... -
The Complexity of Network Design for s-t Eff ective Resistance
(University of Waterloo, 2018-08-23)We consider a new problem of designing a network with small $s$-$t$ effective resistance. In this problem, we are given an undirected graph $G=(V,E)$ where each edge $e$ has a cost $c_e$ and a resistance $r_e$, two ... -
Decomposition-based methods for Connectivity Augmentation Problems
(University of Waterloo, 2021-09-03)In this thesis, we study approximation algorithms for Connectivity Augmentation and related problems. In the Connectivity Augmentation problem, one is given a base graph G=(V,E) that is k-edge-connected, and an additional ... -
Geometric Approximation Algorithms in the Online and Data Stream Models
(University of Waterloo, 2008-10-23)The online and data stream models of computation have recently attracted considerable research attention due to many real-world applications in various areas such as data mining, machine learning, distributed computing, ... -
Minimum Crossing Problems on Graphs
(University of Waterloo, 2007-01-19)This thesis will address several problems in discrete optimization. These problems are considered hard to solve. However, good approximation algorithms for these problems may be helpful in approximating problems in ...