Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 4 of 4 for “"Survivable Network Design"”.
-
Node-weighted prize-collecting survivable network design problems
We consider node-weighted network design problems, in particular the survivable network design problem SNDP and its prize-collecting version PC-SNDP. The input consists of a node-weighted undirected graph $G=(V,E)$ and integral connectivity requirements $r(st)$ for each pair of nodes $st$. The goal …
-
Survivable network design problems with element and vertex connectivity requirements
… we consider degree-bounded element-connectivity Survivable Network Design Problem (Elem-SNDP) and degree-bounded Rooted k-outconnectivity Problem. We suggest bicriteria approximation algorithms that are motivated by Ene and Vakilian's work in [1] and Lau and Zhou's work in [2]. The algorithm …
-
Algorithms and complexity analyses for some combinational optimization problems
… problems in two important areas: scheduling and network design. In the area of scheduling, the main interest is in problems in the master-slave model. In this model, each machine is either a master machine or a slave machine. Each job is associated with a preprocessing task, a slave task and a …
-
Approximation algorithms for submodular optimization and graph problems
… ratio possible. Our focus in this thesis is on designing approximation algorithms for several combinatorial optimization problems. In the first part of this thesis, we study a class of constrained submodular minimization problems. We introduce a model that captures allocation problems with …