A series of approximation algorithms for the Acyclic Directed Steiner Tree problem (1997)
| Venue: | Algorithmica |
| Citations: | 26 - 1 self |
BibTeX
@ARTICLE{Zelikovsky97aseries,
author = {Alexander Zelikovsky},
title = {A series of approximation algorithms for the Acyclic Directed Steiner Tree problem},
journal = {Algorithmica},
year = {1997},
volume = {18},
pages = {99--110}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract Given an acyclic directed network, a subset S of nodes (terminals), and a root r, the acyclic directed Steiner tree problem requires a minimum-cost subnetwork which contains paths from r to each terminal. It is known that unless NP ` DT IME[npolylogn] no polynomial-time algorithm can guarantee better then (ln k)=4- approximation, where k is the number of terminals. In this paper we give an O(kffl)-approximation algorithm for any ffl? 0. This result improves the previously known k-approximation.
