{"_buckets": {"deposit": "165168e8-72a6-4c9c-bde6-b31e9c15be4f"}, "_deposit": {"id": "1910", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "1910"}, "status": "published"}, "_oai": {"id": "oai:niigata-u.repo.nii.ac.jp:00001910", "sets": ["454", "425"]}, "item_5_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "1996-09", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "9", "bibliographicPageEnd": "1503", "bibliographicPageStart": "1495", "bibliographicVolumeNumber": "E79-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 p-collection problem is where to locate p sinks in a flow network such that the value of a maximum flow is maximum. In this paper we show complexity results of the p-collection problem. We prove that the decision problem corresponding to the p-collection problem is strongly NP-complete. Although location problems (the p-center problem and the p-median problem) in networks and flow networks with tree structure is solvable in polynomial time, we prove that the decision problem of the p-collection problem in networks with tree structure, is weakly NP-complete. And we show a polynomial time algorithm for the subproblem of the p-collection problem such that the degree sum of vertices with degree ≧ 3 in a network, is bound to some constant K ≧ 0.", "subitem_description_type": "Abstract"}]}, "item_5_full_name_3": {"attribute_name": "著者別名", "attribute_value_mlt": [{"nameIdentifiers": [{"nameIdentifier": "6185", "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©1996 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": "6182", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Tamura, Hiroshi"}], "nameIdentifiers": [{"nameIdentifier": "6183", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sengoku, Masakazu"}], "nameIdentifiers": [{"nameIdentifier": "6184", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2019-07-29"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "e79-a_9_1495.pdf", "filesize": [{"value": "758.1 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 758100.0, "url": {"label": "e79-a_9_1495.pdf", "url": "https://niigata-u.repo.nii.ac.jp/record/1910/files/e79-a_9_1495.pdf"}, "version_id": "1e52de4d-f886-49f5-900e-00ad24e284d5"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "location problem", "subitem_subject_scheme": "Other"}, {"subitem_subject": "flow network", "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": "The Problem of where to Locate p-Sinks in a Flow Network: Complexity Approach", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "The Problem of where to Locate p-Sinks in a Flow Network: Complexity Approach"}, {"subitem_title": "The Problem of where to Locate p-Sinks in a Flow Network: Complexity Approach", "subitem_title_language": "en"}]}, "item_type_id": "5", "owner": "1", "path": ["454", "425"], "permalink_uri": "http://hdl.handle.net/10191/6521", "pubdate": {"attribute_name": "公開日", "attribute_value": "2008-07-28"}, "publish_date": "2008-07-28", "publish_status": "0", "recid": "1910", "relation": {}, "relation_version_is_last": true, "title": ["The Problem of where to Locate p-Sinks in a Flow Network: Complexity Approach"], "weko_shared_id": null}