{"created":"2025-01-19T01:00:27.336059+00:00","links":{},"updated":"2025-01-19T23:03:38.569853+00:00","id":195532,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00195532","sets":["1164:2592:9674:9784"]},"path":["9784"],"owner":"44499","recid":"195532","title":["C5フリー正則グラフの最大誘導マッチング問題に対する近似アルゴリズム"],"pubdate":{"attribute_name":"公開日","attribute_value":"2019-05-03"},"_buckets":{"deposit":"da2e1b52-16ee-42f3-bfab-15f88deb3816"},"_deposit":{"id":"195532","pid":{"type":"depid","value":"195532","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"C5フリー正則グラフの最大誘導マッチング問題に対する近似アルゴリズム","author_link":["465886","465887","465885","465888"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"C5フリー正則グラフの最大誘導マッチング問題に対する近似アルゴリズム"}]},"item_type_id":"4","publish_date":"2019-05-03","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"九州産業大学"},{"subitem_text_value":"アルバータ大学"},{"subitem_text_value":"九州工業大学"},{"subitem_text_value":"九州工業大学"}]},"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/195532/files/IPSJ-AL19173015.pdf","label":"IPSJ-AL19173015.pdf"},"date":[{"dateType":"Available","dateValue":"2021-05-03"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL19173015.pdf","filesize":[{"value":"455.2 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":"ba813df4-df76-4d30-bc85-19e6d0e4c5df","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2019 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"朝廣, 雄一"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Lin, Guohui"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"柳, 植竜"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"宮野, 英次"}],"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_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8566","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本研究報告では，C5 フリー d次正則グラフ上の最大誘導マッチング問題 （MaxIM） について考える．C5 フリー d次正則グラフ上の MaxIM に対する従来の最良の近似率は (3d/4-1/8+3/16d-8)である．本研究報告では，( 2d/3+1/3 ) 近似アルゴリズムを設計する．この近似率は d ≥ 6 のときに従来のものよりも真に小さい．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2019-05-03","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"15","bibliographicVolumeNumber":"2019-AL-173"}]},"relation_version_is_last":true,"weko_creator_id":"44499"}}