License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SEA.2018.15
URN: urn:nbn:de:0030-drops-89506
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8950/
Ahmed, Reyan ;
Angelini, Patrizio ;
Sahneh, Faryad Darabi ;
Efrat, Alon ;
Glickenstein, David ;
Gronemann, Martin ;
Heinsohn, Niklas ;
Kobourov, Stephen G. ;
Spence, Richard ;
Watkins, Joseph ;
Wolff, Alexander
Multi-Level Steiner Trees
Abstract
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' 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.
BibTeX - Entry
@InProceedings{ahmed_et_al:LIPIcs:2018:8950,
author = {Reyan Ahmed and Patrizio Angelini and Faryad Darabi Sahneh and Alon Efrat and David Glickenstein and Martin Gronemann and Niklas Heinsohn and Stephen G. Kobourov and Richard Spence and Joseph Watkins and Alexander Wolff},
title = {{Multi-Level Steiner Trees}},
booktitle = {17th International Symposium on Experimental Algorithms (SEA 2018)},
pages = {15:1--15:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-070-5},
ISSN = {1868-8969},
year = {2018},
volume = {103},
editor = {Gianlorenzo D'Angelo},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8950},
URN = {urn:nbn:de:0030-drops-89506},
doi = {10.4230/LIPIcs.SEA.2018.15},
annote = {Keywords: Approximation algorithm, Steiner tree, multi-level graph representation}
}
|
Keywords: |
|
Approximation algorithm, Steiner tree, multi-level graph representation |
|
Collection: |
|
17th International Symposium on Experimental Algorithms (SEA 2018) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
19.06.2018 |
