{"id":31997,"updated":"2025-01-22T16:22:23.272415+00:00","links":{},"created":"2025-01-18T23:01:11.728006+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00031997","sets":["1164:2592:2633:2639"]},"path":["2639"],"owner":"1","recid":"31997","title":["最小マンハッタンネットワーク問題に対する近似アルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"2002-01-24"},"_buckets":{"deposit":"f5a3b867-dbf9-4399-8b57-09646018d8c8"},"_deposit":{"id":"31997","pid":{"type":"depid","value":"31997","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"最小マンハッタンネットワーク問題に対する近似アルゴリズム","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"最小マンハッタンネットワーク問題に対する近似アルゴリズム"},{"subitem_title":"An Approximation Algorithm for the Minimum Manhattan Network Problem","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2002-01-24","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"中央大学大学院理工学研究科情報工学専攻"},{"subitem_text_value":"中央大学理工学部情報工学科"},{"subitem_text_value":"中央大学理工学部情報工学科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Information and System Engineering Course Graduate School of Science and Engineering, Chuo University","subitem_text_language":"en"},{"subitem_text_value":"Department of Information and System Engineering, Chuo University","subitem_text_language":"en"},{"subitem_text_value":"Department of Information and System Engineering, Chuo University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/31997/files/IPSJ-AL01082001.pdf"},"date":[{"dateType":"Available","dateValue":"2004-01-24"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL01082001.pdf","filesize":[{"value":"1.4 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"d8b6d57c-6acc-474d-8a35-6464f967937c","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2002 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"加藤亮"},{"creatorName":"今井, 桂子"},{"creatorName":"浅野, 孝夫"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Ryo, Kato","creatorNameLang":"en"},{"creatorName":"Keiko, Imai","creatorNameLang":"en"},{"creatorName":"Takao, Asano","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"平面上に与えられたn個の点集合Sに対して、どの２点間にも２点間のL1-距離に等しい長さのパスが存在するネットワークをSのマンハッタンネットワークという．最小マンハッタンネットワーク問題は、このようなネットワークのうちで、辺の長さの総和（辺長和）が最小となるものを求める問題である．現在、この問題に対して最適解を求める多項式時間のアルゴリズムは知れておらず、既知の(多項式時間）近似アルゴリズムの最良の近似精度は4である．本論文では、この問題に対する２近似アルゴリズムを提案する。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"For a given set S of n points in the plane, a manhattan network for S is a network in which,for each pair of points in S, there is a path between them of length equal to their L1-distance. The minimum manhattan network problem is a problem of finding a manhattan network of minimum length. For this problem, no polynomial time exact algorithm has been known and a 4 approximation algorithm has been proposed. In this paper, we improve this bound and present a 2 approximation algorithm.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2002-01-24","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"7(2001-AL-082)","bibliographicVolumeNumber":"2002"}]},"relation_version_is_last":true,"weko_creator_id":"1"}}