English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Computing Steiner Minimal Trees in Hamming Metric

Althaus, E., & Naujoks, R. (2006). Computing Steiner Minimal Trees in Hamming Metric. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06 (pp. 172-181). New York, USA: ACM / Siam.

Item is

Files

show Files
hide Files
:
soda.pdf (Any fulltext), 189KB
 
File Permalink:
-
Name:
soda.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Althaus, Ernst1, Author           
Naujoks, Rouven1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2007-04-162006
 Publication Status: Issued
 Pages: -
 Publishing info: New York, USA : ACM / Siam
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 314651
Other: Local-ID: C1256428004B93B8-C521C75A9A165EDBC12572810057422C-Naujoks2006
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Miami, USA
Start-/End Date: 2006-01-22

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, USA : ACM / Siam
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 172 - 181 Identifier: ISBN: 0-89871-605-5