An approximation algorithm for directed shallow Steiner trees

Authors:
Andrzej Lingas
Affiliations:
Lund University, Lund
Venue:
Proceedings of the 3rd International Conference on Information and Communication Systems
Year:
2012

Citing 5
Cited 0

Steiner problem in networks: a survey

Networks
Approximating shallow-light trees

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for directed Steiner problems

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Polylogarithmic inapproximability

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Approximation Algorithms for Connected Dominating Sets

Algorithmica

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the problem of constructing a minimum directed Steiner tree of depth O(logd n) in a directed graph of maximum outdegree d admits an exp O(√log n)-approximation in polynomial time.