Optimization problems in network connectivity

[摘要] 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.

[发布机构] Massachusetts Institute of Technology