New primal-dual algorithms for Steiner tree problems

We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree problem (DST), and the set cover problem (SC) which is a subcase of DST. All our problems are NP-hard; so we are interested in approximation algorithms for them. First we give an algorithm for DST which is based on the traditional approach of designing primal-dual approximation algorithms. We show that the approximation factor of the algorithm is k, where k is the the number of terminals, in the case when the problem is restricted to quasibipartite graphs. We also give pathologically bad examples for the algorithm performance. To overcome the problems exposed by the bad examples, we design a new framework for primal-dual algorithms which can be applied to all of our problems. The main feature of the new approach is that, unlike the traditional primal-dual algorithms, it keeps the dual solution in the interior of th...

• Type: Journal
• Year: 2007
• Where: COR
• Authors: Vardges Melkonian
• Keywords: Algorithms, COR 2007, Primal-dual Algorithms, Steiner Tree Problem