Iterative Rounding Approximation Algorithms in Network Design
| dc.contributor.author | Shea, Marcus | |
| dc.date.accessioned | 2010-05-21T19:46:39Z | |
| dc.date.available | 2010-05-21T19:46:39Z | |
| dc.date.issued | 2010-05-21T19:46:39Z | |
| dc.date.submitted | 2010-05 | |
| dc.description.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. | en |
| dc.identifier.uri | http://hdl.handle.net/10012/5239 | |
| dc.language.iso | en | en |
| dc.pending | false | en |
| dc.publisher | University of Waterloo | en |
| dc.subject | iterative rounding | en |
| dc.subject | approximation algorithms | en |
| dc.subject | network design | en |
| dc.subject | degree bounded | en |
| dc.subject | prize collecting | en |
| dc.subject | fractional tokens | en |
| dc.subject.program | Combinatorics and Optimization | en |
| dc.title | Iterative Rounding Approximation Algorithms in Network Design | en |
| dc.type | Master Thesis | en |
| uws-etd.degree | Master of Mathematics | en |
| uws-etd.degree.department | Combinatorics and Optimization | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |