{"created":"2025-01-18T23:01:36.457793+00:00","updated":"2025-01-22T16:07:29.734343+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032546","sets":["1164:2592:2700:2705"]},"path":["2705"],"owner":"1","recid":"32546","title":["最小カット問題の新しい確率的アルゴリズム：計算実験による性能評価"],"pubdate":{"attribute_name":"公開日","attribute_value":"1992-03-23"},"_buckets":{"deposit":"b1a83333-0c07-45b6-8433-a76dc2062f76"},"_deposit":{"id":"32546","pid":{"type":"depid","value":"32546","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":"A New Randomized Algorithm for the Minimum Cut Problem and Its Performance Evaluation","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1992-03-23","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"神戸商科大学管理科学科"},{"subitem_text_value":"神戸商科大学管理科学科"},{"subitem_text_value":"神戸商科大学管理科学科"},{"subitem_text_value":"日本IBM東京基礎研究所"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Management Science, Kobe University of Commerce","subitem_text_language":"en"},{"subitem_text_value":"Department of Management Science, Kobe University of Commerce","subitem_text_language":"en"},{"subitem_text_value":"Department of Management Science, Kobe University of Commerce","subitem_text_language":"en"},{"subitem_text_value":"Tokyo Research Laboratory, IBM Japan","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/32546/files/IPSJ-AL91026003.pdf"},"date":[{"dateType":"Available","dateValue":"1994-03-23"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL91026003.pdf","filesize":[{"value":"949.0 kB"}],"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":"79458706-312c-4fe6-afc6-c5c0ab8484b9","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1992 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"大塚啓司"},{"creatorName":"戴陽"},{"creatorName":"加藤, 直樹"},{"creatorName":"岩野, 和生"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Keisi, Ohtsuka","creatorNameLang":"en"},{"creatorName":"Yang, Dai","creatorNameLang":"en"},{"creatorName":"Naoki, Katoh","creatorNameLang":"en"},{"creatorName":"Kazuo, Iwano","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":"G=（，）をn個の節点とm本の枝からなる連結な無向グラフとするとき、Gの初等的カットのなかで枝数最小のカット（最小カット）を求める確率的アルゴリズムを提案し、その性能を計算機実験で評価する。アルゴリズムは最大格差最小カットを求める高速解法にもとずくもので、その理論的評価は未解決であるが、計算機実験の結果、最小カットを求める厳密解法と比較すると少ない計算量で最小カットに近いカットが求められることが確かめられた。また同様の手法をGを等分割する最小カットを求める問題（グラフの2分割問題）に対しても開発し、その性能を従来の　Kernighan　and　Lin　による近似解法と比較実験した。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Let G=(V,E) be a connected undirected graph with n vertices and m. We shall propose a new randomized algorithm for finding a minimum cut based on a fast algorithm for finding a minimum range cut. Though the theoretical evaluation has not been done yet, computer experiments show that our algorithm outputs a cut very close to the exact minimum cut with the running time shorter than the best known algorithm for the minimum cut problem. We also propose a randomized algorithm based on the similar idea for finding a minimum cut of G into equal sizes. We also report the results of computer experiments that compare our algorithm with Kernighan and Lin's algorithm.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"24","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"17","bibliographicIssueDates":{"bibliographicIssueDate":"1992-03-23","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"27(1991-AL-026)","bibliographicVolumeNumber":"1992"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":32546,"links":{}}