Show simple item record

dc.contributor.authorAu, Yu Hin Jay
dc.date.accessioned2008-01-16 16:15:58 (GMT)
dc.date.available2008-01-16 16:15:58 (GMT)
dc.date.issued2008-01-16T16:15:58Z
dc.date.submitted2008
dc.identifier.urihttp://hdl.handle.net/10012/3485
dc.description.abstractIn this thesis, we study the behaviour of Lovasz and Schrijver's lift-and-project operators N and N_0 while being applied recursively to the fractional stable set polytope of a graph. We focus on two related conjectures proposed by Liptak and Tuncel: the N-N_0 Conjecture and Rank Conjecture. First, we look at the algebraic derivation of new valid inequalities by the operators N and N_0. We then present algebraic characterizations of these valid inequalities. Tightly based on our algebraic characterizations, we give an alternate proof of a result of Lovasz and Schrijver, establishing the equivalence of N and N_0 operators on the fractional stable set polytope. Since the above mentioned conjectures involve also the recursive applications of N and N_0 operators, we also study the valid inequalities obtained by these lift-and-project operators after two applications. We show that the N-N_0 Conjecture is false, while the Rank Conjecture is true for all graphs with no more than 8 nodes.en
dc.language.isoenen
dc.publisherUniversity of Waterlooen
dc.subjectLift-and-projecten
dc.subjectStable set problemen
dc.titleOn the Polyhedral Lift-and-Project Rank Conjecture for the Fractional Stable Set Polytopeen
dc.typeMaster Thesisen
dc.pendingfalseen
dc.subject.programCombinatorics and Optimizationen
uws-etd.degree.departmentCombinatorics and Optimizationen
uws-etd.degreeMaster of Mathematicsen
uws.typeOfResourceTexten
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages