{"created":"2025-01-18T23:01:30.272583+00:00","updated":"2025-01-22T16:10:55.846653+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032406","sets":["1164:2592:2686:2689"]},"path":["2689"],"owner":"1","recid":"32406","title":["グラフのk辺連結化問題に対する新しい近似解法"],"pubdate":{"attribute_name":"公開日","attribute_value":"1994-07-22"},"_buckets":{"deposit":"67b17d5f-9fb7-4271-af60-8a1eaa849ace"},"_deposit":{"id":"32406","pid":{"type":"depid","value":"32406","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"グラフのk辺連結化問題に対する新しい近似解法","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"グラフのk辺連結化問題に対する新しい近似解法"},{"subitem_title":"New Approximation Algorithms for the k -Edge- Connectivity Augmentation Problem","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1994-07-22","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"広島大学工学部第二類回路システム工学講座"},{"subitem_text_value":"広島大学工学部第二類回路システム工学講座"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Circuits and Systems, Faculty of Engineering, Hiroshima University","subitem_text_language":"en"},{"subitem_text_value":"Department of Circuits and Systems, Faculty of Engineering, Hiroshima 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/32406/files/IPSJ-AL94040004.pdf"},"date":[{"dateType":"Available","dateValue":"1996-07-22"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL94040004.pdf","filesize":[{"value":"1.3 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":"ca218f6b-d4be-4f26-8bef-c0bf37cbd8e1","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1994 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"間島, 利也"},{"creatorName":"渡辺, 敏正"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Toshiya, Mashima","creatorNameLang":"en"},{"creatorName":"Toshimasa, Watanabe","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":"本論文ではコスト付きのk辺連結化問題（?kE)に対する近似解法について報告する．我我は既にW?kECAに対して4つの近似解法を提案し，比較実験では最大コストマッチングを用いた近似解法FSMが最良であることを示した．ここでは，次の2つの結果を与える．第一に，W?kECAに対する新しい近似解法MWを提案し，辺連結度を1だけ上げるW?kECAに対してMWの近似解は最適解の2倍以下で抑えられることを理論的に証明する．第二に，近似解を改良するための辺の交換手法EXCHANGEを既存の4つの近似解法とMWに組み込み，その有効性を実験的に明示する．さらにEXCHANGEの組み込み後でも，これらの5つの近似解法の中でFSMがやはり最良の近似解を与えることも実験的に示す．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"New approximation algorithms for the weighted k-edge-connectivity augmentation problem (W-kECA) are considered. We have already proposed four approximation algorithms for W-kECA, and have shown experimentally that the approximation algorithm FSM using maximum-cost matching algorithm gives the best approximation among them. In this paper, two results are given. First, a new approximation algorithm MW is proposed, and it is proved theoretically that MW produces approximation whose total cost can be bounded by twice the optimum for the case where the edge connectivity is increased by one. Secondly a simple postprocessing for improvement of a solution is incorporated into any one of the previous four algorithms as well as MW, and it is experimentally shown that total cost of each solution is greatly reduced. It is also presented that, even after such improvement, FSM remains giving the best approximation among these five algorithms.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"32","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"25","bibliographicIssueDates":{"bibliographicIssueDate":"1994-07-22","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"69(1994-AL-040)","bibliographicVolumeNumber":"1994"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":32406,"links":{}}