|
UWSpace >
University of Waterloo >
Electronic Theses and Dissertations (UW) >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10012/5239
|
| Title: | Iterative Rounding Approximation Algorithms in Network Design |
| Authors: | Shea, Marcus |
| Keywords: | iterative rounding
approximation algorithms
network design
degree bounded
prize collecting
fractional tokens |
| Approved Date: | 21-May-2010 |
| Date Submitted: | May-2010 |
| Abstract: | 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 Problem (SNDP). This paper looks at several important iterative rounding approximation algorithms and makes improvements to some of their proofs. We generalize a matrix restatement of Nagarajan et al.'s token argument, which we can use to simplify the proofs of Jain's 2-approximation for SNDP and Fleischer et al.'s 2-approximation for the Element Connectivity (ELC) problem. Lau et al. show how one can construct a (2,2B + 3)-approximation for the degree bounded ELC problem, and this thesis provides the proof. We provide some structural results for basic feasible solutions of the Prize-Collecting Steiner Tree problem, and introduce a new problem that arises, which we call the Prize-Collecting Generalized Steiner Tree problem. |
| Program: | Combinatorics and Optimization |
| Department: | Combinatorics and Optimization |
| Degree: | Master of Mathematics |
| URI: | http://hdl.handle.net/10012/5239 |
| Appears in Collections: | Electronic Theses and Dissertations (UW)
Faculty of Mathematics Theses and Dissertations
|
This item is protected by original copyright
|
All items in UWSpace are protected by copyright, with all rights reserved.
|
