{"id":106911,"updated":"2025-01-21T09:14:11.684495+00:00","links":{},"created":"2025-01-18T23:50:13.609106+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00106911","sets":["1164:2592:7425:7738"]},"path":["7738"],"owner":"11","recid":"106911","title":["次数制約のあるグラフ有向化問題の計算複雑さについて"],"pubdate":{"attribute_name":"公開日","attribute_value":"2014-11-13"},"_buckets":{"deposit":"f878e0c5-1ca7-4a38-9a4d-10b99c546752"},"_deposit":{"id":"106911","pid":{"type":"depid","value":"106911","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"次数制約のあるグラフ有向化問題の計算複雑さについて","author_link":["14558","14560","14557","14559"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"次数制約のあるグラフ有向化問題の計算複雑さについて"}]},"item_type_id":"4","publish_date":"2014-11-13","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/106911/files/IPSJ-AL14150019.pdf"},"date":[{"dateType":"Available","dateValue":"2016-11-13"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL14150019.pdf","filesize":[{"value":"481.1 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":"f71cd7a3-2240-4739-aa0d-1c70519316d3","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2014 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"朝廣雄一"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"ジャンソンジェスパー"}],"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_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"無向グラフに対するオリエンテーション （グラフ有向化） とは，各辺に対して向き付けを行うことである．オリエンテーションによる結果として得られる有向グラフにおいて，各頂点の出次数が事前に指定された下界あるいは上界を満たす場合に，それを次数制約オリエンテーションと呼ぶ．本稿では，次数制約オリエンテーションを求める問題の一種である，2 つのお互いに関連する Min W-Light 問題と Max W-Heavy 問題について考える．任意の固定された非負整数 W に対して，Min W-Light （または Max W-Heavy） 問題は，入力された無向グラフ G のオリエンテーションのうち，出次数 W 以下 （または W 以上） の頂点数を最小化 （または最大化） するものを発見することを目的とする．これらの問題の計算複雑さは W の値によって変化する．本稿では，これらの問題の計算複雑さ （主に近似可能性） に関するいくつかの結果を示す．","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":"2014-11-13","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"19","bibliographicVolumeNumber":"2014-AL-150"}]},"relation_version_is_last":true,"weko_creator_id":"11"}}