3 research outputs found
The Complexity of Network Design for s-t Eff ective Resistance
We consider a new problem of designing a network with small - effective resistance.
In this problem, we are given an undirected graph where each edge has a cost and a resistance , two designated vertices , and a cost budget .
Our goal is to choose a subgraph to minimize the - effective resistance, subject to the constraint that the total cost in the subgraph is at most .
This problem has applications in electrical network design and is an interpolation between the shortest path problem and the minimum cost flow problem.
We present algorithmic and hardness results for this problem.
On the hardness side, we show that the problem is NP-hard by reducing the 3-dimensional matching problem to our problem.
On the algorithmic side, we use dynamic programming to obtain a fully polynomial time approximation scheme when the input graph is a series-parallel graph. Finally, we propose a greedy algorithm for general graphs in which we add a path at each iteration and we conjecture that the algorithm is a -approximation algorithm for the problem
Iterative Rounding Approximation Algorithms in Network Design
Iterative rounding has been an increasingly popular approach to solving network design optimization problems ever since Jain introduced the concept in his revolutionary 2-approximation for the Survivable Network Design Problem (SNDP). This paper looks at several important iterative rounding approximation algorithms and makes improvements to some of their proofs. We generalize a matrix restatement of Nagarajan et al.'s token argument, which we can use to simplify the proofs of Jain's 2-approximation for SNDP and Fleischer et al.'s 2-approximation for the Element Connectivity (ELC) problem. Lau et al. show how one can construct a (2,2B + 3)-approximation for the degree bounded ELC problem, and this thesis provides the proof. We provide some structural results for basic feasible solutions of the Prize-Collecting Steiner Tree problem, and introduce a new problem that arises, which we call the Prize-Collecting Generalized Steiner Tree problem