{"created":"2023-06-19T11:37:40.371327+00:00","id":5071,"links":{},"metadata":{"_buckets":{"deposit":"6cb054c7-50c4-46a3-b7c9-618417d0f8ba"},"_deposit":{"created_by":13,"id":"5071","owners":[13],"pid":{"revision_id":0,"type":"depid","value":"5071"},"status":"published"},"_oai":{"id":"oai:mie-u.repo.nii.ac.jp:00005071","sets":["366:367:368:393"]},"author_link":["10925","10926","10927","10928"],"item_4_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2000-12-27","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"96","bibliographicPageStart":"81","bibliographicVolumeNumber":"25","bibliographic_titles":[{"bibliographic_title":"Research reports of the Faculty of Engineering, Mie University"}]}]},"item_4_description_14":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_4_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"The Traveling Salesman Problem (TSP) is the task of finding a route through a given set of cities with shortest possible length. Many practical applications (VLSI design, etc.) can be modeled as a TSP. But, TSP is NP-hard, so the efficient approximation algorithms have been studied so far. In this paper, we show new approximation algorithms for TSP and the experimental results for these algorithms.","subitem_description_type":"Abstract"}]},"item_4_publisher_30":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"Faculty of Engineering, Mie University"}]},"item_4_source_id_7":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"0385-6208","subitem_source_identifier_type":"PISSN"}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA00816341","subitem_source_identifier_type":"NCID"}]},"item_4_text_18":{"attribute_name":"その他のタイトル","attribute_value_mlt":[{"subitem_text_language":"en","subitem_text_value":"On the Approximation Algorithm for Traveling Salesman Problem"}]},"item_4_text_65":{"attribute_name":"資源タイプ（三重大）","attribute_value_mlt":[{"subitem_text_value":"Departmental Bulletin Paper / 紀要論文"}]},"item_4_version_type_15":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"坂上, 知英","creatorNameLang":"ja"},{"creatorName":"SAKAGAMI, Tomohide","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"吉澤, 慎","creatorNameLang":"ja"},{"creatorName":"YOSHIZAWA, Makoto","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"太田, 義勝","creatorNameLang":"ja"},{"creatorName":"OHTA, Yoshikatsu","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"大山口, 通夫","creatorNameLang":"ja"},{"creatorName":"OYAMAGUCHI, Michio","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2017-02-18"}],"displaytype":"detail","filename":"AA008163410250009.PDF","filesize":[{"value":"812.4 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"AA008163410250009.PDF","url":"https://mie-u.repo.nii.ac.jp/record/5071/files/AA008163410250009.PDF"},"version_id":"c06e8441-8ca4-46ad-a574-45d02fbd93f8"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"Traveling Salesman Problem","subitem_subject_scheme":"Other"},{"subitem_subject":"Approximation Algorithm","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"巡回セールスマン問題の近似アルゴリズムについて","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"巡回セールスマン問題の近似アルゴリズムについて","subitem_title_language":"ja"}]},"item_type_id":"4","owner":"13","path":["393"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2007-07-02"},"publish_date":"2007-07-02","publish_status":"0","recid":"5071","relation_version_is_last":true,"title":["巡回セールスマン問題の近似アルゴリズムについて"],"weko_creator_id":"13","weko_shared_id":-1},"updated":"2023-10-05T07:30:54.630864+00:00"}