DeepAI AI Chat
Log In Sign Up

Approximation algorithms for priority Steiner tree problems

by   Faryad Darabi Sahneh, et al.

In the Priority Steiner Tree (PST) problem, we are given an undirected graph G=(V,E) with a source s ∈ V and terminals T ⊆ V ∖{s}, where each terminal v ∈ T requires a nonnegative priority P(v). The goal is to compute a minimum weight Steiner tree containing edges of varying rates such that the path from s to each terminal v consists of edges of rate greater than or equal to P(v). The PST problem with k priorities admits a min{2 ln |T| + 2, kρ}-approximation [Charikar et al., 2004], and is hard to approximate with ratio c loglog n for some constant c [Chuzhoy et al., 2008]. In this paper, we first strengthen the analysis provided by [Charikar et al., 2004] for the (2 ln |T| + 2)-approximation to show an approximation ratio of ⌈log_2 |T| ⌉ + 1 ≤ 1.443 ln |T| + 2, then provide a very simple, parallelizable algorithm which achieves the same approximation ratio. We then consider a more difficult node-weighted version of the PST problem, and provide a (2 ln |T|+2)-approximation using extensions of the spider decomposition by [Klein & Ravi, 1995]. This is the first result for the PST problem in node-weighted graphs. Moreover, the approximation ratios for all above algorithms are tight.


page 1

page 2

page 3

page 4


Kruskal-based approximation algorithm for the multi-level Steiner tree problem

We study the multi-level Steiner tree problem: a generalization of the S...

Infinite Lewis Weights in Spectral Graph Theory

We study the spectral implications of re-weighting a graph by the ℓ_∞-Le...

Tight Approximation Guarantees for Concave Coverage Problems

In the maximum coverage problem, we are given subsets T_1, …, T_m of a u...

Hierarchical Clustering: a 0.585 Revenue Approximation

Hierarchical Clustering trees have been widely accepted as a useful form...

External memory priority queues with decrease-key and applications to graph algorithms

We present priority queues in the external memory model with block size ...

Multi-Level Steiner Trees

In the classical Steiner tree problem, one is given an undirected, conne...

A computational study of Gomory-Hu tree algorithms

We present an experimental study of algorithms for computing the Gomory-...