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):|
|Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView|