A Polylogarithmic Approximation for Computing Non-Metric Terminal Steiner Trees

Information Processing Letters (Impact Factor: 0.55). 09/2010; 110(18):826-829. DOI: 10.1016/j.ipl.2010.07.006
Source: DBLP


The main contribution of this short note is to provide improved bounds on the approximability of constructing terminal Steiner trees in arbitrary undirected graphs. Technically speaking, our results are obtained by relating this computational task to that of computing group Steiner trees. As a secondary objective, we make a concentrated effort to distinguish between the factor by which constructed trees exceed the optimal backbone cost and between the deviation from the optimal terminal linking cost.

Download full-text


Available from: Iftah Gamzu, Jun 26, 2014
  • [Show abstract] [Hide abstract]
    ABSTRACT: We propose a methodology to determine value by adding functionalities for convergent products. A collection of base functions and sub-functions configure the nodes of a web-based (digital) network representing functionalities. Each arc in the network is to be assigned as the link between two nodes. The aim is to find an optimal tree of functionalities in the network adding value to the product in the web environment. First, a purification process is performed in the product network to assign the links among bases and sub-functions. Then, numerical values as benefits and costs are determined for arcs and nodes respectively, using a mathematical approach. Finally, the Steiner tree methodology is adapted to a bi-objective model for the network to find the optimal tree determining the value adding sub-functions to bases in a convergent product. To fulfil the bi-objective model a ε-constraint methodology is used and the parto optimal solutions are evaluated. An example is worked out to illustrate the applicability of the proposed approach.
    International Journal of Services and Operations Management 01/2014; 17(2):142 - 167. DOI:10.1504/IJSOM.2014.058841