A Faster Approximation Algorithm for the Steiner Problem in Graphs

Local TagsRelease HistoryDetailsSummary

A Faster Approximation Algorithm for the Steiner Problem in Graphs

Mehlhorn, K. (1987). A Faster Approximation Algorithm for the Steiner Problem in Graphs.

Item is Released

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AEAE-F Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AEAF-D

Genre: Other

show

show

hide

Creators:
Mehlhorn, Kurt¹, Author

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

show

show

hide

Language(s): eng - English

Dates: Modified: 2006-09-20Date issued: 1987

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: eDoc: 344623
Other: Local-ID: C1256428004B93B8-C308DB10CE52704EC12571C2004DEC8D-mehlhorn87h

Degree: -

show

show

show

show