English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  A faster 11/6-approximation algorithm for the Steiner tree problem in graphs

Zelikovsky, A.(1992). A faster 11/6-approximation algorithm for the Steiner tree problem in graphs (MPI-I-92-122). 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-B6F7-8 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-002D-F14C-D
Genre: Report

Files

show Files
hide Files
:
MPI-I-92-122.pdf (Any fulltext), 7MB
View   Save
File Permalink:
https://hdl.handle.net/11858/00-001M-0000-0019-D456-5
Name:
MPI-I-92-122.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: The Steiner problem requires a shortest tree spanning a given vertex subset $S$ within graph $G=(V,E)$. There are two 11/6-approximation algorithms with running time $O(VE+VS^2+S^4)$ and $O(VE+VS^2+S^{3+{1\over 2}})$, respectively. Now we decrease the implementation time to $O(ES+VS^2+VlogV)$.

Details

show
hide
Language(s): eng - English
 Dates: 1992
 Publication Status: Issued
 Pages: 8 p.
 Publishing info: Saarbrücken : Max-Planck-Institut für Informatik
 Table of Contents: -
 Rev. Type: -
 Identifiers: Report Nr.: MPI-I-92-122
 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: -