Loading...

Parameterized Approximation Algorithms for Bounded Diameter Minimum Steiner Tree Problem

Mashreghi, Ali | 2014

1134 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 46563 (02)
  4. University: Sharif University of Technology
  5. Department: Mathematical Sciences
  6. Advisor(s): Zarei, Alireza
  7. Abstract:
  8. Given a graph G with a set of terminals, two weight functions c and d defined on the edge set of G, and a bound D, a popular NP-hard problem in designing networks is to find the minimum cost Steiner tree (under function c) in G, to connect all terminals in such a way that its diameter (under function d) is bounded by D. Marathe et al. [1] proposed an (O(log2n);O(log2n)) approximation algorithm for this bicriteria problem, where n is the number of terminals. The first factor reflects the approximation ratio on the diameter bound D, and the second factor indicates the cost-approximation ratio. Later, Kapoor and Sarwat [2] introduced a parameterized approximation algorithm with performance guarantee of (O(plogpn);O(logpn)) for any input value p > 1, by which one can improve the approximation factor for cost at the price of worsening the approximation factor of diameter. In this dissertation, we consider the reverse scenario in which minimizing the diameter of the solution is more important. We first propose a parameterized approximation algorithm with performance guarantee of (O(log p Hp n);O(pHplog p Hp n)), where Hp = 1+1=2+: : :+1=p is the p th harmonic number. Parameter p is part of the input and this algorithm
    runs in polynomial time for constant values of p. We also present another algorithm with approximation ratio of (O(logpn);O( plogpn)) which elies on the approximation factor () of the NP-hard problem min-degree constrained minimum spanning tree
  9. Keywords:
  10. Approximate Algorithm ; Bicriteria Network Design ; Bounded Diameter ; Minimum Steiner Tree

 Digital Object List