A faster approximation algorithm for the Steiner problem in graphs

Mehlhorn, Kurt

Item

ITEM ACTIONSEXPORT

DownloadE-Mail

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_1332100_2

DetailsSummary

A faster approximation algorithm for the Steiner problem in graphs

Mehlhorn, K. (1988). A faster approximation algorithm for the Steiner problem in graphs. Information Processing Letters, 27, 125-128.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AE82-D Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AE83-B

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Mehlhorn, Kurt¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2008-03-05Date issued: 1988

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 344570
Other: Local-ID: C1256428004B93B8-2518D080565ECFEEC1257147004B5D58-IPL::Mehlhorn1988

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Information Processing Letters

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 27 Sequence Number: - Start / End Page: 125 - 128 Identifier: ISSN: 0020-0190