Simultaneous Matchings: Hardness and Approximation

Kutz, Martin; Elbassioni, Khaled; Katriel, Irit; Mahajan, Meena

doi:10.1016/j.jcss.2008.02.001

アイテム詳細

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

一時保存へ追加

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

公開

学術論文

Simultaneous Matchings: Hardness and Approximation

MPS-Authors

/persons/resource/persons44874

Kutz, Martin
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/persons44744

Katriel, Irit
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44966

Mahajan, Meena
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

引用

Kutz, M., Elbassioni, K., Katriel, I., & Mahajan, M. (2008). Simultaneous Matchings: Hardness and Approximation. Journal of Computer and System Sciences, 74(5), 884-897. doi:10.1016/j.jcss.2008.02.001.

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

要旨

要旨はありません