ログイン
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_buckets": {"deposit": "40ddf62d-ee91-4fe1-af05-d9b527daec7b"}, "_deposit": {"id": "1907", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "1907"}, "status": "published"}, "_oai": {"id": "oai:niigata-u.repo.nii.ac.jp:00001907", "sets": ["454", "425"]}, "item_5_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "1997-04", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "4", "bibliographicPageEnd": "657", "bibliographicPageStart": "651", "bibliographicVolumeNumber": "E80-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": "In this paper we extend the p-collection problem to a flow network with lower bounds, and call the extended problem the lower-bounded p-collection problem. First we discuss the complexity of this problem to show NP-hardness for a network with path structure. Next we present a linear time algorithm for the lower-bounded 1-collection problem in a network with tree structure, and a pseudo-polynomial time algorithm with dynamic programming type for the lower-bounded p-collection problem in a network with tree structure. Using the pseudo-polynomial time algorithm, we show an exponential algorithm, which is efficient in a connected network with few cycles, for the lower-bounded p-collection problem.", "subitem_description_type": "Abstract"}]}, "item_5_full_name_3": {"attribute_name": "著者別名", "attribute_value_mlt": [{"nameIdentifiers": [{"nameIdentifier": "5597", "nameIdentifierScheme": "WEKO"}], "names": [{"name": "中野, 敬介"}]}, {"nameIdentifiers": [{"nameIdentifier": "6172", "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©1997 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": "Tamura, Hiroshi"}], "nameIdentifiers": [{"nameIdentifier": "6168", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Nakano, Keisuke"}], "nameIdentifiers": [{"nameIdentifier": "5597", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sengoku, Masakazu"}], "nameIdentifiers": [{"nameIdentifier": "6170", "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": "e80-a_4_651.pdf", "filesize": [{"value": "528.1 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 528100.0, "url": {"label": "e80-a_4_651.pdf", "url": "https://niigata-u.repo.nii.ac.jp/record/1907/files/e80-a_4_651.pdf"}, "version_id": "87e89fd7-ea53-49ed-be5a-eaafde0fb886"}]}, "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": "The p-Collection Problem in a Flow Network with Lower Bounds", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "The p-Collection Problem in a Flow Network with Lower Bounds"}, {"subitem_title": "The p-Collection Problem in a Flow Network with Lower Bounds", "subitem_title_language": "en"}]}, "item_type_id": "5", "owner": "1", "path": ["454", "425"], "permalink_uri": "http://hdl.handle.net/10191/6524", "pubdate": {"attribute_name": "公開日", "attribute_value": "2008-07-28"}, "publish_date": "2008-07-28", "publish_status": "0", "recid": "1907", "relation": {}, "relation_version_is_last": true, "title": ["The p-Collection Problem in a Flow Network with Lower Bounds"], "weko_shared_id": null}
  1. 060 工学部
  2. 10 学術雑誌論文
  3. 10 査読済論文
  1. 0 資料タイプ別
  2. 01 学術雑誌論文

The p-Collection Problem in a Flow Network with Lower Bounds

http://hdl.handle.net/10191/6524
http://hdl.handle.net/10191/6524
5da19a5b-27e1-4070-84a2-3623d0d9fca8
名前 / ファイル ライセンス アクション
e80-a_4_651.pdf e80-a_4_651.pdf (528.1 kB)
Item type 学術雑誌論文 / Journal Article(1)
公開日 2008-07-28
タイトル
タイトル The p-Collection Problem in a Flow Network with Lower Bounds
タイトル
言語 en
タイトル The p-Collection Problem in a Flow Network with Lower Bounds
言語
言語 eng
キーワード
主題Scheme Other
主題 location problem
キーワード
主題Scheme Other
主題 network flows
キーワード
主題Scheme Other
主題 NP-complete
キーワード
主題Scheme Other
主題 optimization problem
資源タイプ
資源 http://purl.org/coar/resource_type/c_6501
タイプ journal article
著者 Tamura, Hiroshi

× Tamura, Hiroshi

WEKO 6168

Tamura, Hiroshi

Search repository
Nakano, Keisuke

× Nakano, Keisuke

WEKO 5597

Nakano, Keisuke

Search repository
Sengoku, Masakazu

× Sengoku, Masakazu

WEKO 6170

Sengoku, Masakazu

Search repository
著者別名
識別子 5597
識別子Scheme WEKO
姓名 中野, 敬介
著者別名
識別子 6172
識別子Scheme WEKO
姓名 仙石, 正和
抄録
内容記述タイプ Abstract
内容記述 In this paper we extend the p-collection problem to a flow network with lower bounds, and call the extended problem the lower-bounded p-collection problem. First we discuss the complexity of this problem to show NP-hardness for a network with path structure. Next we present a linear time algorithm for the lower-bounded 1-collection problem in a network with tree structure, and a pseudo-polynomial time algorithm with dynamic programming type for the lower-bounded p-collection problem in a network with tree structure. Using the pseudo-polynomial time algorithm, we show an exponential algorithm, which is efficient in a connected network with few cycles, for the lower-bounded p-collection problem.
書誌情報 IEICE transactions on fundamentals of electronics, communications and computer sciences
en : IEICE transactions on fundamentals of electronics, communications and computer sciences

巻 E80-A, 号 4, p. 651-657, 発行日 1997-04
出版者
出版者 The Institute of Electronics, Information and Communication Engineers
ISSN
収録物識別子タイプ ISSN
収録物識別子 09168508
書誌レコードID
収録物識別子タイプ NCID
収録物識別子 AA10826239
権利
権利情報 copyright©1997 IEICE
著者版フラグ
値 publisher
異版である
関連タイプ isVersionOf
識別子タイプ URI
関連識別子 http://www.ieice.org/jpn/trans_online/
戻る
0
views
See details
Views

Versions

Ver.1 2021-03-01 20:50:36.801612
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3