UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

A Primal Dual Algorithm On 2-Steiner Graphs

Thumbnail Image

Files

Buckley_Matthew.pdf (554.53 KB)

Date

2018-01-23

Authors

Buckley, Matthew

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

The Steiner Tree Problem is a fundamental network design problem, where the goal is to connect a subset of terminals of a given network at minimum cost. A major open question regarding this problem, is proving that the integrality gap of a certain linear program relaxation, called the bidirected cut relaxation (BCR), is strictly smaller than 2. In this thesis, we prove that (BCR) has integrality gap at most 5/3 for a subset of instances, which we call 2-Steiner instances, via a primal-dual method.

Description

Keywords

LC Keywords

Citation

URI

http://hdl.handle.net/10012/12949

Collections

Theses
Combinatorics and Optimization