Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society


Minimum base of weighted k polymatroid and Steiner tree problem

Zelikovsky, Alexander

MPI-I-92-121. June 1992, 9 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
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.
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-92-121.pdfMPI-I-92-121.pdf3082 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document:
Hide details for BibTeXBibTeX
  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},