Approximating the Interval Constrained Coloring Problem

Althaus, Ernst; Canzar, Stefan; Elbassioni, Khaled; Karrenbauer, Andreas; Mestre, Julián

doi:10.1007/978-3-540-69903-3_20

アイテム詳細

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

一時保存へ追加

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

公開

会議論文

Approximating the Interval Constrained Coloring Problem

MPS-Authors

/persons/resource/persons44003

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

/persons/resource/persons44218

Canzar, Stefan
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44374

Elbassioni, Khaled
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44737

Karrenbauer, Andreas
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dx74n
(出版社版)

Fulltext (restricted access)

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

フルテキスト (公開)

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

付随資料 (公開)

There is no public supplementary material available

引用

Althaus, E., Canzar, S., Elbassioni, K., Karrenbauer, A., & Mestre, J. (2008). Approximating the Interval Constrained Coloring Problem. In J., Gudmundsson (Ed.), Algorithm Theory – SWAT 2008 (pp. 210-221). Berlin: Springer. doi:10.1007/978-3-540-69903-3_20.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-1B03-D

要旨

要旨はありません