Browsing Combinatorics and Optimization by Subject "Approximation Algorithms"
Now showing items 1-3 of 3
-
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 ... -
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 ... -
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 ...