English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 DetailsSummary
  Minimum base of weighted k polymatroid and Steiner tree problem

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.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-B6F5-C Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0019-D453-B
Genre: Report

Files

show Files
hide Files
:
MPI-I-92-121.pdf (Any fulltext), 4MB
View   Save
File Permalink:
https://hdl.handle.net/11858/00-001M-0000-0019-D454-9
Name:
MPI-I-92-121.pdf
Description:
-
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
View
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Zelikovsky, Alexander1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 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.

Details

show
hide
Language(s): eng - English
 Dates: 1992
 Publication Status: Issued
 Pages: 9 p.
 Publishing info: Saarbrücken : Max-Planck-Institut für Informatik
 Table of Contents: -
 Rev. Type: -
 Identifiers: URI: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/92-121
Report Nr.: MPI-I-92-121
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Research Report / Max-Planck-Institut für Informatik
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -