MPI-INF Logo
MPI-INF/SWS Research Reports 1991-2021

2. Number - All Departments

MPI-I-92-121

Minimum base of weighted k polymatroid and Steiner tree problem

Zelikovsky, Alexander

June 1992, 9 pages.

.
Status: available - back from printing

A generalized greedy approximation algorithm for finding the lightest base of a weighted $k$--polymatroid and its applications to the Steiner tree problem is presented.

URL to this document: https://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1992-121

Hide details for BibTeXBibTeX
@TECHREPORT{Zelikovsky92a,
  AUTHOR = {Zelikovsky, Alexander},
  TITLE = {Minimum base of weighted k polymatroid and Steiner tree problem},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-92-121},
  MONTH = {June},
  YEAR = {1992},
  ISSN = {0946-011X},
}