Browsing Combinatorics and Optimization by Subject "network design"
Now showing items 1-5 of 5
-
Building Networks in the Face of Uncertainty
(University of Waterloo, 2011-08-26)The subject of this thesis is to study approximation algorithms for some network design problems in face of uncertainty. We consider two widely studied models of handling uncertainties - Robust Optimization and Stochastic ... -
Capacitated Network Design on Outerplanar Graphs
(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 ... -
Iterative Rounding Approximation Algorithms in Network Design
(University of Waterloo, 2010-05-21)Iterative rounding has been an increasingly popular approach to solving network design optimization problems ever since Jain introduced the concept in his revolutionary 2-approximation for the Survivable Network Design ... -
Node-Weighted Prize Collecting Steiner Tree and Applications
(University of Waterloo, 2013-05-23)The Steiner Tree problem has appeared in the Karp's list of the first 21 NP-hard problems and is well known as one of the most fundamental problems in Network Design area. We study the Node-Weighted version of the Prize ... -
Stochastic Minimum Norm Combinatorial Optimization
(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 ...