FasterDSP: A faster approximation algorithm for directed steiner tree problem

研究成果: 雜誌貢獻期刊論文同行評審

18 引文 斯高帕斯(Scopus)


Given a weighted directed graph G = (V, E, c), where c : E → R + is an edge cost function, a subset X of vertices (terminals), and a root vertex vr, the directed Steiner tree problem (DSP) asks for a minimum-cost tree which spans the paths from root vertex vr to each terminal. Charikar et al.'s algorithm is well-known for this problem. It achieves an approximation guarantee of l(l - 1)kl1 in O(n lk2l) time for any fixed level l > 1, where l is the level of the tree produced by the algorithm, n is the number of vertices, |V|, and k is the number of terminals, |X|. However, it requires a great amount of computing power, and there are some problems in the proof of the approximation guarantee of the algorithm. This paper provides a faster approximation algorithm improving Charikar et al.'s DSP algorithm with a better time complexity, O(nlkl + n2k + nm), where m is the number of edges, and an amended √8k - δ In k factor for the 2-level Steiner tree, where δ = √6 - 2 = 0.4494.

頁(從 - 到)1409-1425
期刊Journal of Information Science and Engineering
出版狀態已出版 - 11月 2006


深入研究「FasterDSP: A faster approximation algorithm for directed steiner tree problem」主題。共同形成了獨特的指紋。