On the complexity of approximating Euclidean traveling salesman tours and 
minimum spanning trees

Das, Gautam; Kapoor, Sanjiv; Smid, Michiel

アイテム詳細

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

一時保存へ追加

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

公開

学術論文

On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees

MPS-Authors

/persons/resource/persons44283

Das, Gautam
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44728

Kapoor, Sanjiv
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45509

Smid, Michiel
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

引用

Das, G., Kapoor, S., & Smid, M. (1997). On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees. Algorithmica, 19, 447-460.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-395E-F

要旨

要旨はありません