{"created":"2021-03-01T06:05:35.212347+00:00","id":1903,"links":{},"metadata":{"_buckets":{"deposit":"3136bf05-1cae-4ec6-9c1c-d70cf50e5c76"},"_deposit":{"id":"1903","owners":[],"pid":{"revision_id":0,"type":"depid","value":"1903"},"status":"published"},"_oai":{"id":"oai:niigata-u.repo.nii.ac.jp:00001903","sets":["423:424:425","453:454"]},"item_5_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1998-03","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicPageEnd":"475","bibliographicPageStart":"470","bibliographicVolumeNumber":"E81-A","bibliographic_titles":[{"bibliographic_title":"IEICE transactions on fundamentals of electronics, communications and computer sciences"},{"bibliographic_title":"IEICE transactions on fundamentals of electronics, communications and computer sciences","bibliographic_titleLang":"en"}]}]},"item_5_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"The lower-bounded p-collection problem is the problem where to locate p sinks in a flow network with lower bounds such that the value of a maximum flow is maximum. This paper discusses the cover problems corresponding to the lower bounded p-collection problem. We consider the complexity of the cover problem, and we show polynomial time algorithms for its subproblems in a network with tree structure.","subitem_description_type":"Abstract"}]},"item_5_full_name_3":{"attribute_name":"著者別名","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"6152","nameIdentifierScheme":"WEKO"}],"names":[{"name":"仙石, 正和"}]}]},"item_5_publisher_7":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"The Institute of Electronics, Information and Communication Engineers"}]},"item_5_relation_31":{"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/","subitem_relation_type_select":"URI"}}]},"item_5_rights_15":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"copyright©1998 IEICE"}]},"item_5_select_19":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_select_item":"publisher"}]},"item_5_source_id_11":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA10826239","subitem_source_identifier_type":"NCID"}]},"item_5_source_id_9":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"09168508","subitem_source_identifier_type":"ISSN"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Watanabe, Kaoru"}],"nameIdentifiers":[{"nameIdentifier":"6148","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Sengoku, Masakazu"}],"nameIdentifiers":[{"nameIdentifier":"6149","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Tamura, Hiroshi"}],"nameIdentifiers":[{"nameIdentifier":"6150","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"Shinoda, Shoji"}],"nameIdentifiers":[{"nameIdentifier":"5445","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2019-07-29"}],"displaytype":"detail","filename":"e81-a_3_470.pdf","filesize":[{"value":"540.5 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"e81-a_3_470.pdf","url":"https://niigata-u.repo.nii.ac.jp/record/1903/files/e81-a_3_470.pdf"},"version_id":"22df8fce-de2e-4189-8100-e5a04851c1c5"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"location problem","subitem_subject_scheme":"Other"},{"subitem_subject":"network flows","subitem_subject_scheme":"Other"},{"subitem_subject":"NP-complete","subitem_subject_scheme":"Other"},{"subitem_subject":"optimization problem","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":"Covering Problems in the p-Collection Problems","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Covering Problems in the p-Collection Problems"},{"subitem_title":"Covering Problems in the p-Collection Problems","subitem_title_language":"en"}]},"item_type_id":"5","owner":"1","path":["454","425"],"pubdate":{"attribute_name":"公開日","attribute_value":"2008-07-31"},"publish_date":"2008-07-31","publish_status":"0","recid":"1903","relation_version_is_last":true,"title":["Covering Problems in the p-Collection Problems"],"weko_creator_id":"1","weko_shared_id":null},"updated":"2022-12-15T03:34:44.753878+00:00"}