The relation of Connected Set Cover and Group Steiner Tree

Elbassioni, Khaled; Jelić, Slobodan; Matijević, Domagoj

doi:10.1016/j.tcs.2012.02.035

アイテム詳細

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

一時保存へ追加

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

公開

学術論文

The relation of Connected Set Cover and Group Steiner Tree

MPS-Authors

/persons/resource/persons44374

Elbassioni, Khaled
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

引用

Elbassioni, K., Jelić, S., & Matijević, D. (2012). The relation of Connected Set Cover and Group Steiner Tree. Theoretical Computer Science, 438, 96-101. doi:10.1016/j.tcs.2012.02.035.

引用: https://hdl.handle.net/11858/00-001M-0000-0014-BC9B-A

要旨

要旨はありません