7 research outputs found
Multi-Level Steiner Trees
In the classical Steiner tree problem, one is given an undirected, connected graph G=(V,E) with non-negative edge costs and a set of terminals T subseteq V. The objective is to find a minimum-cost edge set E\u27 subseteq E that spans the terminals. The problem is APX-hard; the best known approximation algorithm has a ratio of rho = ln(4)+epsilon < 1.39. In this paper, we study a natural generalization, the multi-level Steiner tree (MLST) problem: given a nested sequence of terminals T_1 subset ... subset T_k subseteq V, compute nested edge sets E_1 subseteq ... subseteq E_k subseteq E that span the corresponding terminal sets with minimum total cost.
The MLST problem and variants thereof have been studied under names such as Quality-of-Service Multicast tree, Grade-of-Service Steiner tree, and Multi-Tier tree. Several approximation results are known. We first present two natural heuristics with approximation factor O(k). Based on these, we introduce a composite algorithm that requires 2^k Steiner tree computations. We determine its approximation ratio by solving a linear program. We then present a method that guarantees the same approximation ratio and needs at most 2k Steiner tree computations. We compare five algorithms experimentally on several classes of graphs using four types of graph generators. We also implemented an integer linear program for MLST to provide ground truth. Our combined algorithm outperforms the others both in theory and in practice when the number of levels is small (k <= 22), which works well for applications such as designing multi-level infrastructure or network visualization
Multi-Level Weighted Additive Spanners
Given a graph G = (V, E), a subgraph H is an additive +β spanner if distH(u, v) ≤ distG(u, v) + β for all u, v ∈ V. A pairwise spanner is a spanner for which the above inequality is only required to hold for specific pairs P ⊆ V × V given on input; when the pairs have the structure P = S × S for some S ⊆ V, it is called a subsetwise spanner. Additive spanners in unweighted graphs have been studied extensively in the literature, but have only recently been generalized to weighted graphs. In this paper, we consider a multi-level version of the subsetwise additive spanner in weighted graphs motivated by multi-level network design and visualization, where the vertices in S possess varying level, priority, or quality of service (QoS) requirements. The goal is to compute a nested sequence of spanners with the minimum total number of edges. We first generalize the +2 subsetwise spanner of [Pettie 2008, Cygan et al., 2013] to the weighted setting. We experimentally measure the performance of this and several existing algorithms by [Ahmed et al., 2020] for weighted additive spanners, both in terms of runtime and sparsity of the output spanner, when applied as a subroutine to multi-level problem. We provide an experimental evaluation on graphs using several different random graph generators and show that these spanner algorithms typically achieve much better guarantees in terms of sparsity and additive error compared with the theoretical maximum. By analyzing our experimental results, we additionally developed a new technique of changing a certain initialization parameter which provides better spanners in practice at the expense of a small increase in running time. © Reyan Ahmed, Greg Bodwin, Faryad Darabi Sahneh, Keaton Hamm, Stephen Kobourov, and Richard Spence; licensed under Creative Commons License CC-BY 4.0 19th International Symposium on Experimental Algorithms (SEA 2021).Open access journalThis item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at [email protected]
Kruskal-Based Approximation Algorithm for the Multi-Level Steiner Tree Problem
We study the multi-level Steiner tree problem: a generalization of the
Steiner tree problem in graphs where terminals require varying priority,
level, or quality of service. In this problem, we seek to find a minimum cost
tree containing edges of varying rates such that any two terminals ,
with priorities , are connected using edges of rate
or better. The case where edge costs are proportional to
their rate is approximable to within a constant factor of the optimal solution.
For the more general case of non-proportional costs, this problem is hard to
approximate with ratio , where is the number of vertices in
the graph. A simple greedy algorithm by Charikar et al., however, provides a
-approximation in this setting, where
is an approximation ratio for a heuristic solver for the Steiner tree problem
and is the number of priorities or levels (Byrka et al. give a Steiner
tree algorithm with , for example).
In this paper, we describe a natural generalization to the multi-level case
of the classical (single-level) Steiner tree approximation algorithm based on
Kruskal's minimum spanning tree algorithm. We prove that this algorithm
achieves an approximation ratio at least as good as Charikar et al., and
experimentally performs better with respect to the optimum solution. We develop
an integer linear programming formulation to compute an exact solution for the
multi-level Steiner tree problem with non-proportional edge costs and use it to
evaluate the performance of our algorithm on both random graphs and multi-level
instances derived from SteinLib