MPI-INF/SWS Research Reports 1991-2021
2. Number - All Departments
MPI-I-92-122
A faster 11/6-approximation algorithm for the Steiner tree problem in graphs
Zelikovsky, Alexander
June 1992, 8 pages.
.Status: available - back from printing
The Steiner problem requires a shortest tree spanning a given
vertex subset $S$ within graph $G=(V,E)$. There are
two 11/6-approximation
algorithms with running time $O(VE+VS^2+S^4)$ and
$O(VE+VS^2+S^{3+{1\over 2}})$, respectively. Now we decrease
the implementation time to $O(ES+VS^2+VlogV)$.
-
MPI-I-92-122.pdf
- Attachement: MPI-I-92-122.pdf (6618 KBytes)
URL to this document: https://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1992-122
BibTeX@TECHREPORT{Zelikovsky92b,
AUTHOR = {Zelikovsky, Alexander},
TITLE = {A faster 11/6-approximation algorithm for the Steiner tree problem in graphs},
TYPE = {Research Report},
INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
NUMBER = {MPI-I-92-122},
MONTH = {June},
YEAR = {1992},
ISSN = {0946-011X},
}