Advanced Search
DSpace@MIT

Optimization problems in network connectivity

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.advisor David R. Karger. en_US
dc.contributor.author Panigrahi, Debmalya en_US
dc.contributor.other Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. en_US
dc.date.accessioned 2013-04-12T15:14:09Z
dc.date.available 2013-04-12T15:14:09Z
dc.date.copyright 2012 en_US
dc.date.issued 2012 en_US
dc.identifier.uri http://hdl.handle.net/1721.1/78362
dc.description Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012. en_US
dc.description This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. en_US
dc.description Cataloged from student-submitted PDF version of thesis. en_US
dc.description Includes bibliographical references (p. 115-120). en_US
dc.description.abstract Besides being one of the principal driving forces behind research in algorithmic theory for more than five decades, network optimization has assumed increased significance in recent times with the advent and widespread use of a variety of large-scale real-life networks. The primary goal of such networks is to connect vertices (representing a variety of real-life entities) in a robust and inexpensive manner, and to store and retrieve such connectivity information efficiently. In this thesis, we present efficient algorithms aimed at achieving these broad goals. The main results presented in this thesis are as follows. -- Cactus Construction. We give a near-linear time Monte Carlo algorithm for constructing a cactus representation of all the minimum cuts in an undirected graph. -- Cut Sparsification. A cut sparsifier of an undirected graph is a sparse graph on the same set of vertices that preserves its cut values up to small errors. We give new combinatorial and algorithmic results for constructing cut sparsifiers. -- Online Steiner Tree. Given an undirected graph as input, the goal of the Steiner tree problem is to select its minimum cost subgraph that connects a designated subset of vertices. We give the first online algorithm for the Steiner tree problem that has a poly-logarithmic competitive ratio when the input graph has both node and edge costs. -- Network Activation Problems. In the design of real-life wireless networks, a typical objective is to select one among a possible set of parameter values at each node such that the set of activated links satisfy some desired connectivity properties. We formalize this as the network activation model, and give approximation algorithms for various fundamental network design problems in this model. en_US
dc.description.statementofresponsibility by Debmalya Panigrahi. en_US
dc.format.extent 120 p. en_US
dc.language.iso eng en_US
dc.publisher Massachusetts Institute of Technology en_US
dc.rights M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. en_US
dc.rights.uri http://dspace.mit.edu/handle/1721.1/7582 en_US
dc.subject Electrical Engineering and Computer Science. en_US
dc.title Optimization problems in network connectivity en_US
dc.type Thesis en_US
dc.description.degree Ph.D. en_US
dc.contributor.department Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. en_US
dc.identifier.oclc 832728876 en_US


Files in this item

Name Size Format Description
832728876-MIT.pdf 1.094Mb PDF Full printable version

This item appears in the following Collection(s)

Show simple item record

MIT-Mirage