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 2 of 2 for “"flow-cut gaps"”.
-
Unique Games Conjecture : the Boolean Hypercube and connections to graph lifts
… integrality gap of the SDP and Mutlicommodity flow-cut gaps which may lead to an understanding of the behaviour of the SDP on general families of graphs. As a quick corollary we establish that the SDP is exact for planar graphs. The second question is concerned with spectrum of label extended …
-
Layering principles for wireless networks
… networks is the near optimality of routing (flow) for multiple-unicast traffic: the min-cut upper bound is within a logarithmic factor of the number of sources of the max-flow. This establishes the approximate capacity of multiple-unicast in wireline networks. In this thesis, we ``extend'' …