{"_buckets": {"deposit": "837fa40d-2f78-4047-9465-b8f4508c018a"}, "_deposit": {"id": "10820", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "10820"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00010820", "sets": ["314"]}, "author_link": ["32516", "32517", "32518"], "item_10_alternative_title_19": {"attribute_name": "その他のタイトル", "attribute_value_mlt": [{"subitem_alternative_title": "A Graph-Theoretic Algorithm for {2, 3}-EC-SNDP", "subitem_alternative_title_language": "en"}]}, "item_10_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2005-11-01", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "11", "bibliographicPageEnd": "1687", "bibliographicPageStart": "1679", "bibliographicVolumeNumber": "J88-D-I", "bibliographic_titles": [{"bibliographic_title": "電子情報通信学会論文誌", "bibliographic_titleLang": "ja"}]}]}, "item_10_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "辺連結サバイバルネットワーク設計問題（Edge Connectivity SurvivableNetwork Design Problem，EC-SNDP）とは，無向グラフG=(V,E)と各頂点ペア(u, v)に対する辺連結要求ruvが入力として与えられたとき，各頂点ペア(u, v)の辺連結度がruv以上となるような最小重み部分グラフを出力する問題である．本研究では，すべての頂点ペア(u, v)に対する辺連結度ruvを2または3に制限した，辺に重みのない｛2,3｝-EC-SNDPに対し，深さ優先探索と極大森を組み合わせたアルゴリズムを提案し，その近似比率が7/3となることを示す．更に，このアルゴリズムを改良し近似比率が2となることを示す．", "subitem_description_language": "ja", "subitem_description_type": "Abstract"}]}, "item_10_identifier_60": {"attribute_name": "URI", "attribute_value_mlt": [{"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2237/12665"}, {"subitem_identifier_type": "URI", "subitem_identifier_uri": "http://www.ieice.org/jpn/trans_online/index.html"}]}, "item_10_publisher_32": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "電子情報通信学会", "subitem_publisher_language": "ja"}]}, "item_10_relation_43": {"attribute_name": "関連情報", "attribute_value_mlt": [{"subitem_relation_type": "isVersionOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "http://www.ieice.org/jpn/trans_online/index.html", "subitem_relation_type_select": "URI"}}]}, "item_10_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "Copyright 2005 IEICE", "subitem_rights_language": "en"}]}, "item_10_select_15": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_10_source_id_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "0915-1915", "subitem_source_identifier_type": "PISSN"}]}, "item_10_text_14": {"attribute_name": "フォーマット", "attribute_value_mlt": [{"subitem_text_value": "application/pdf"}]}, "item_1615787544753": {"attribute_name": "出版タイプ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_970fb48d4fbd8a85", "subitem_version_type": "VoR"}]}, "item_access_right": {"attribute_name": "アクセス権", "attribute_value_mlt": [{"subitem_access_right": "open access", "subitem_access_right_uri": "http://purl.org/coar/access_right/c_abf2"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "勝谷, 裕樹", "creatorNameLang": "ja"}], "nameIdentifiers": [{"nameIdentifier": "32516", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "小野, 孝男", "creatorNameLang": "ja"}], "nameIdentifiers": [{"nameIdentifier": "32517", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "平田, 富夫", "creatorNameLang": "ja"}], "nameIdentifiers": [{"nameIdentifier": "32518", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2018-02-20"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "j88-d1_11_1679.pdf", "filesize": [{"value": "208.7 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 208700.0, "url": {"label": "j88-d1_11_1679.pdf", "objectType": "fulltext", "url": "https://nagoya.repo.nii.ac.jp/record/10820/files/j88-d1_11_1679.pdf"}, "version_id": "c491a258-2185-4ac7-af38-34fd1599ad8a"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "ネットワーク設計問題", "subitem_subject_scheme": "Other"}, {"subitem_subject": "深さ優先探索", "subitem_subject_scheme": "Other"}, {"subitem_subject": "極大森", "subitem_subject_scheme": "Other"}, {"subitem_subject": "辺連結度", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "jpn"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "グラフ論的手法を用いた{2, 3}-EC-SNDPに対する近似アルゴリズム(アルゴリズム, \u003c小特集\u003eユビキタス社会構築のためのネットワークに対する理論とその応用論文)", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "グラフ論的手法を用いた{2, 3}-EC-SNDPに対する近似アルゴリズム(アルゴリズム, \u003c小特集\u003eユビキタス社会構築のためのネットワークに対する理論とその応用論文)", "subitem_title_language": "ja"}]}, "item_type_id": "10", "owner": "1", "path": ["314"], "permalink_uri": "http://hdl.handle.net/2237/12665", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2010-02-09"}, "publish_date": "2010-02-09", "publish_status": "0", "recid": "10820", "relation": {}, "relation_version_is_last": true, "title": ["グラフ論的手法を用いた{2, 3}-EC-SNDPに対する近似アルゴリズム(アルゴリズム, \u003c小特集\u003eユビキタス社会構築のためのネットワークに対する理論とその応用論文)"], "weko_shared_id": -1}