de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Report

Minimum base of weighted k polymatroid and Steiner tree problem

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45793

Zelikovsky,  Alexander
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)

MPI-I-92-121.pdf
(Any fulltext), 4MB

Supplementary Material (public)
There is no public supplementary material available
Citation

Zelikovsky, A.(1992). Minimum base of weighted k polymatroid and Steiner tree problem (MPI-I-92-121). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-B6F5-C
Abstract
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.