{"created":"2023-05-15T15:28:04.018144+00:00","id":50,"links":{},"metadata":{"_buckets":{"deposit":"a75407f1-d769-4f6f-af65-12a1a85ce268"},"_deposit":{"created_by":3,"id":"50","owners":[3],"pid":{"revision_id":0,"type":"depid","value":"50"},"status":"published"},"_oai":{"id":"oai:barrel.repo.nii.ac.jp:00000050","sets":[]},"author_link":["280","281","282"],"item_1_biblio_info_5":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2007-03","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"1","bibliographicPageEnd":"93","bibliographicPageStart":"81","bibliographicVolumeNumber":"372","bibliographic_titles":[{"bibliographic_title":"Theoretical Computer Science"}]}]},"item_1_publisher_6":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"Elsevier"}]},"item_1_relation_8":{"attribute_name":"DOI","attribute_value_mlt":[{"subitem_relation_type":"isVersionOf","subitem_relation_type_id":{"subitem_relation_type_id_text":"info:doi/10.1016/j.tcs.2006.11.010","subitem_relation_type_select":"DOI"}}]},"item_1_rights_13":{"attribute_name":"出版社版URI","attribute_value_mlt":[{"subitem_rights":"http://www.sciencedirect.com/science/journal/03043975"}]},"item_1_source_id_11":{"attribute_name":"書誌ID（NCID）","attribute_value_mlt":[{"subitem_source_identifier":"AA00862688","subitem_source_identifier_type":"NCID"}]},"item_1_source_id_7":{"attribute_name":"ISSN / EISSN","attribute_value_mlt":[{"subitem_source_identifier":"0304-3975","subitem_source_identifier_type":"ISSN"}]},"item_1_subject_16":{"attribute_name":"日本十進分類法","attribute_value_mlt":[{"subitem_subject":"007","subitem_subject_scheme":"NDC"}]},"item_1_subject_17":{"attribute_name":"NIIサブジェクト","attribute_value_mlt":[{"subitem_subject":"情報学","subitem_subject_scheme":"Other"}]},"item_1_version_type_15":{"attribute_name":"テキストバージョン","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_ab4af688f83e57aa","subitem_version_type":"AM"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Ishii, Toshimasa"}],"nameIdentifiers":[{"nameIdentifier":"280","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Fujita, Hitoshi"}],"nameIdentifiers":[{"nameIdentifier":"281","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Nagamochi, Hirosh"}],"nameIdentifiers":[{"nameIdentifier":"282","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2016-01-22"}],"displaytype":"detail","filename":"theoretical_computer_science_372(1).pdf","filesize":[{"value":"337.2 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"theoretical_computer_science_372(1).pdf","url":"https://barrel.repo.nii.ac.jp/record/50/files/theoretical_computer_science_372(1).pdf"},"version_id":"8a751aa6-05bc-46c2-9888-33584f5a7dc7"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"Graph algorithm","subitem_subject_scheme":"Other"},{"subitem_subject":"Undirected graph","subitem_subject_scheme":"Other"},{"subitem_subject":"Location problem","subitem_subject_scheme":"Other"},{"subitem_subject":"Local vertex-connectivity","subitem_subject_scheme":"Other"},{"subitem_subject":"Polynomial time algorithm","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"Minimum cost source location problem with local 3-vertex-connectivity requirements","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Minimum cost source location problem with local 3-vertex-connectivity requirements"}]},"item_type_id":"1","owner":"3","path":["4"],"pubdate":{"attribute_name":"公開日","attribute_value":"2007-11-27"},"publish_date":"2007-11-27","publish_status":"0","recid":"50","relation_version_is_last":true,"title":["Minimum cost source location problem with local 3-vertex-connectivity requirements"],"weko_creator_id":"3","weko_shared_id":3},"updated":"2023-07-20T07:43:25.702563+00:00"}