Minimum base of weighted k polymatroid and Steiner tree problem

Zelikovsky, Alexander

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

このアイテムの新しいバージョンが利用可能です:
https://pure.mpg.de/pubman/item/item_1834896_4

詳細要約

公開

報告書

Minimum base of weighted k polymatroid and Steiner tree problem

MPS-Authors

/persons/resource/persons45793

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

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

MPI-I-92-121.pdf
(全文テキスト（全般）), 4MB

付随資料 (公開)

There is no public supplementary material available

引用

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.

引用: https://hdl.handle.net/11858/00-001M-0000-0014-B6F5-C

要旨

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.