On the Low-dimensional Steiner Minimum Tree Problem in Hamming Metric

Althaus, Ernst; Kupilas, Joschka; Naujoks, Rouven

doi:10.1007/978-3-642-20877-5_31

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

On the Low-dimensional Steiner Minimum Tree Problem in Hamming Metric

MPS-Authors

/persons/resource/persons44003

Althaus, Ernst
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons71821

Kupilas, Joschka
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45109

Naujoks, Rouven
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Althaus, E., Kupilas, J., & Naujoks, R. (2011). On the Low-dimensional Steiner Minimum Tree Problem in Hamming Metric. In M., Ogihara, & J., Tarui (Eds.), Theory and Applications of Models of Computation (pp. 308-319). Berlin: Springer. doi:10.1007/978-3-642-20877-5_31.

引用: https://hdl.handle.net/11858/00-001M-0000-0010-126B-A

要旨

要旨はありません