WEKO3
アイテム
{"_buckets": {"deposit": "7ce351f8-6931-4b79-9ae2-1bb48a9af892"}, "_deposit": {"id": "39724", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "39724"}, "status": "published"}, "_oai": {"id": "oai:tsukuba.repo.nii.ac.jp:00039724", "sets": ["5509", "1134"]}, "item_5_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2016-09", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "3", "bibliographicPageEnd": "1774", "bibliographicPageStart": "1758", "bibliographicVolumeNumber": "30", "bibliographic_titles": [{"bibliographic_title": "SIAM journal on discrete mathematics "}]}]}, "item_5_creator_3": {"attribute_name": "著者別名", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "小林, 佑輔"}], "nameIdentifiers": [{"nameIdentifier": "151506", "nameIdentifierScheme": "WEKO"}]}]}, "item_5_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "Edmonds\u0027s fundamental theorem on arborescences in [J. Edmonds, Edge-disjoint branchings, in Combinatorial Algorithms, Courant Comput. Sci. Sympos. 9, Algorithmics Press, New York, 1973, pp. 91--96] characterizes the existence of $k$ pairwise arc-disjoint spanning arborescences with the same root in a directed graph. In [L. Lovász, J. Combinatorial Theory Ser. B, 21 (1976), pp. 96--103], Lovász gave an elegant alternative proof which became the basis of many extensions of Edmonds\u0027s result. In this paper, we use a modification of Lovász\u0027s method to prove a theorem on covering intersecting bi-set families under matroid constraints. Our result can be considered as an extension of previous results on packing arborescences. We also investigate the algorithmic aspects of the problem and present a polynomial-time algorithm for solving the corresponding optimization problem.\n\n", "subitem_description_type": "Abstract"}]}, "item_5_publisher_27": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "SIAM Publications"}]}, "item_5_relation_11": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type_id": {"subitem_relation_type_id_text": "10.1137/15M1049099", "subitem_relation_type_select": "DOI"}}]}, "item_5_relation_9": {"attribute_name": "書誌レコードID", "attribute_value_mlt": [{"subitem_relation_type_id": {"subitem_relation_type_id_text": " AA10701131 ", "subitem_relation_type_select": "NCID"}}]}, "item_5_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": " ©2009 Society for Industrial and Applied Mathematics "}]}, "item_5_select_15": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_5_source_id_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "0895-4801", "subitem_source_identifier_type": "ISSN"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Bérczi, Kristóf"}], "nameIdentifiers": [{"nameIdentifier": "151503", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Király, Tamás"}], "nameIdentifiers": [{"nameIdentifier": "151504", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Kobayashi, Yusuke"}], "nameIdentifiers": [{"nameIdentifier": "151505", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2016-11-17"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "SIAM_JDM_30-3.pdf", "filesize": [{"value": "227.7 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 227700.0, "url": {"label": "SIAM_JDM_30-3", "url": "https://tsukuba.repo.nii.ac.jp/record/39724/files/SIAM_JDM_30-3.pdf"}, "version_id": "d5856d55-12e5-41ac-b5a1-1b42a984de33"}]}, "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 Intersecting Bi-set Families under Matroid Constraints", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Covering Intersecting Bi-set Families under Matroid Constraints"}]}, "item_type_id": "5", "owner": "1", "path": ["5509", "1134"], "permalink_uri": "http://hdl.handle.net/2241/00144385", "pubdate": {"attribute_name": "公開日", "attribute_value": "2016-11-17"}, "publish_date": "2016-11-17", "publish_status": "0", "recid": "39724", "relation": {}, "relation_version_is_last": true, "title": ["Covering Intersecting Bi-set Families under Matroid Constraints"], "weko_shared_id": 5}
Covering Intersecting Bi-set Families under Matroid Constraints
http://hdl.handle.net/2241/00144385
http://hdl.handle.net/2241/00144385afa70ca0-54d9-48ab-9934-4ae012de528b
名前 / ファイル | ライセンス | アクション |
---|---|---|
SIAM_JDM_30-3 (227.7 kB)
|
|
Item type | Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2016-11-17 | |||||
タイトル | ||||||
タイトル | Covering Intersecting Bi-set Families under Matroid Constraints | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源 | http://purl.org/coar/resource_type/c_6501 | |||||
タイプ | journal article | |||||
著者 |
Bérczi, Kristóf
× Bérczi, Kristóf× Király, Tamás× Kobayashi, Yusuke |
|||||
著者別名 |
小林, 佑輔
× 小林, 佑輔 |
|||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | Edmonds's fundamental theorem on arborescences in [J. Edmonds, Edge-disjoint branchings, in Combinatorial Algorithms, Courant Comput. Sci. Sympos. 9, Algorithmics Press, New York, 1973, pp. 91--96] characterizes the existence of $k$ pairwise arc-disjoint spanning arborescences with the same root in a directed graph. In [L. Lovász, J. Combinatorial Theory Ser. B, 21 (1976), pp. 96--103], Lovász gave an elegant alternative proof which became the basis of many extensions of Edmonds's result. In this paper, we use a modification of Lovász's method to prove a theorem on covering intersecting bi-set families under matroid constraints. Our result can be considered as an extension of previous results on packing arborescences. We also investigate the algorithmic aspects of the problem and present a polynomial-time algorithm for solving the corresponding optimization problem. | |||||
書誌情報 |
SIAM journal on discrete mathematics 巻 30, 号 3, p. 1758-1774, 発行日 2016-09 |
|||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 0895-4801 | |||||
DOI | ||||||
識別子タイプ | DOI | |||||
関連識別子 | 10.1137/15M1049099 | |||||
権利 | ||||||
権利情報 | ©2009 Society for Industrial and Applied Mathematics | |||||
著者版フラグ | ||||||
値 | publisher | |||||
出版者 | ||||||
出版者 | SIAM Publications |