{"id":"https://openalex.org/W2509962125","doi":"https://doi.org/10.1137/15m1049099","title":"Covering Intersecting Bi-set Families under Matroid Constraints","display_name":"Covering Intersecting Bi-set Families under Matroid Constraints","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2509962125","doi":"https://doi.org/10.1137/15m1049099","mag":"2509962125"},"language":"en","primary_location":{"id":"doi:10.1137/15m1049099","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1049099","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://tsukuba.repo.nii.ac.jp/record/39724/files/SIAM_JDM_30-3.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064012507","display_name":"Krist\u00f3f B\u00e9rczi","orcid":"https://orcid.org/0000-0003-0457-4573"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Krist\u00f3f B\u00e9rczi","raw_affiliation_strings":["MTA-ELTE Egerv\u00e1ry Research Group, Department of Operations Research, E\u00f6tv\u00f6s University, 1117 Budapest, Hungary"],"affiliations":[{"raw_affiliation_string":"MTA-ELTE Egerv\u00e1ry Research Group, Department of Operations Research, E\u00f6tv\u00f6s University, 1117 Budapest, Hungary","institution_ids":["https://openalex.org/I106118109"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072284685","display_name":"Tam\u00e1s Kir\u00e1ly","orcid":"https://orcid.org/0000-0001-7218-2112"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Tam\u00e1s Kir\u00e1ly","raw_affiliation_strings":["MTA-ELTE Egerv\u00e1ry Research Group, Department of Operations Research, E\u00f6tv\u00f6s University, 1117 Budapest, Hungary"],"affiliations":[{"raw_affiliation_string":"MTA-ELTE Egerv\u00e1ry Research Group, Department of Operations Research, E\u00f6tv\u00f6s University, 1117 Budapest, Hungary","institution_ids":["https://openalex.org/I106118109"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074548000","display_name":"Yusuke Kobayashi","orcid":"https://orcid.org/0000-0001-9478-7307"},"institutions":[{"id":"https://openalex.org/I146399215","display_name":"University of Tsukuba","ror":"https://ror.org/02956yf07","country_code":"JP","type":"education","lineage":["https://openalex.org/I146399215"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Yusuke Kobayashi","raw_affiliation_strings":["University of Tsukuba, Tsukuba, Ibaraki, 305-8573, Japan"],"affiliations":[{"raw_affiliation_string":"University of Tsukuba, Tsukuba, Ibaraki, 305-8573, Japan","institution_ids":["https://openalex.org/I146399215"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5074548000"],"corresponding_institution_ids":["https://openalex.org/I146399215"],"apc_list":null,"apc_paid":null,"fwci":2.5159,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.9029912,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":"30","issue":"3","first_page":"1758","last_page":"1774"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.9067604541778564},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7977558374404907},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7647483348846436},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6170699000358582},{"id":"https://openalex.org/keywords/matroid-partitioning","display_name":"Matroid partitioning","score":0.6098241806030273},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.543799877166748},{"id":"https://openalex.org/keywords/weighted-matroid","display_name":"Weighted matroid","score":0.5300334095954895},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5262816548347473},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4733191430568695},{"id":"https://openalex.org/keywords/graphic-matroid","display_name":"Graphic matroid","score":0.4296565055847168},{"id":"https://openalex.org/keywords/oriented-matroid","display_name":"Oriented matroid","score":0.4254035949707031}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.9067604541778564},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7977558374404907},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7647483348846436},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6170699000358582},{"id":"https://openalex.org/C22425182","wikidata":"https://www.wikidata.org/wiki/Q6787906","display_name":"Matroid partitioning","level":4,"score":0.6098241806030273},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.543799877166748},{"id":"https://openalex.org/C124344645","wikidata":"https://www.wikidata.org/wiki/Q7979897","display_name":"Weighted matroid","level":5,"score":0.5300334095954895},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5262816548347473},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4733191430568695},{"id":"https://openalex.org/C111034964","wikidata":"https://www.wikidata.org/wiki/Q5597156","display_name":"Graphic matroid","level":3,"score":0.4296565055847168},{"id":"https://openalex.org/C178621168","wikidata":"https://www.wikidata.org/wiki/Q16155113","display_name":"Oriented matroid","level":4,"score":0.4254035949707031}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/15m1049099","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1049099","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:real.mtak.hu:39385","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400081","display_name":"Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210140733","host_organization_name":"Library and Information Centre of the Hungarian Academy of Sciences","host_organization_lineage":["https://openalex.org/I4210140733"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:tsukuba.repo.nii.ac.jp:00039724","is_oa":true,"landing_page_url":"http://hdl.handle.net/2241/00144385","pdf_url":"https://tsukuba.repo.nii.ac.jp/record/39724/files/SIAM_JDM_30-3.pdf","source":{"id":"https://openalex.org/S4306402076","display_name":"Terrestrial Environment Research Center (University of Tsukuba)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I146399215","host_organization_name":"University of Tsukuba","host_organization_lineage":["https://openalex.org/I146399215"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.724.3895","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.724.3895","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.elte.hu/%7Eberkri/Papers/BercziR10.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:tsukuba.repo.nii.ac.jp:00039724","is_oa":true,"landing_page_url":"http://hdl.handle.net/2241/00144385","pdf_url":"https://tsukuba.repo.nii.ac.jp/record/39724/files/SIAM_JDM_30-3.pdf","source":{"id":"https://openalex.org/S4306402076","display_name":"Terrestrial Environment Research Center (University of Tsukuba)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I146399215","host_organization_name":"University of Tsukuba","host_organization_lineage":["https://openalex.org/I146399215"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1577646778","display_name":null,"funder_award_id":"Kawarabayashi Large Graph Project","funder_id":"https://openalex.org/F4320334789","funder_display_name":"Japan Science and Technology Agency"},{"id":"https://openalex.org/G3159705473","display_name":null,"funder_award_id":"24106002","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G6063911051","display_name":null,"funder_award_id":"K109240","funder_id":"https://openalex.org/F4320321994","funder_display_name":"Hungarian Scientific Research Fund"},{"id":"https://openalex.org/G8326857615","display_name":"Using dual concepts in graph minor algorithms","funder_award_id":"24700004","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320321994","display_name":"Hungarian Scientific Research Fund","ror":"https://ror.org/00v349e63"},{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"},{"id":"https://openalex.org/F4320334789","display_name":"Japan Science and Technology Agency","ror":"https://ror.org/00097mb19"},{"id":"https://openalex.org/F4320338112","display_name":"Exploratory Research for Advanced Technology","ror":null}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2509962125.pdf"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W1563601717","https://openalex.org/W1974428378","https://openalex.org/W1987229183","https://openalex.org/W2012329067","https://openalex.org/W2015382802","https://openalex.org/W2035575256","https://openalex.org/W2062251071","https://openalex.org/W2073834089","https://openalex.org/W2112607208","https://openalex.org/W2128059732","https://openalex.org/W2548665519","https://openalex.org/W2962695452","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2400862597","https://openalex.org/W1984819493","https://openalex.org/W2058489697","https://openalex.org/W2625145881","https://openalex.org/W2159059797","https://openalex.org/W2072414647","https://openalex.org/W4246417054","https://openalex.org/W2106233458","https://openalex.org/W4226057593","https://openalex.org/W2006784845"],"abstract_inverted_index":{"Edmonds's":[0,68],"fundamental":[1],"theorem":[2,83],"on":[3,84,103],"arborescences":[4,33],"in":[5,10,38],"[J.":[6],"Edmonds,":[7],"Edge-disjoint":[8],"branchings,":[9],"Combinatorial":[11,46],"Algorithms,":[12],"Courant":[13],"Comput.":[14],"Sci.":[15],"Sympos.":[16],"9,":[17],"Algorithmics":[18],"Press,":[19],"New":[20],"York,":[21],"1973,":[22],"pp.":[23,52],"91--96]":[24],"characterizes":[25],"the":[26,35,62,109,113,122],"existence":[27],"of":[28,64,67,77,100,112],"$k$":[29],"pairwise":[30],"arc-disjoint":[31],"spanning":[32],"with":[34],"same":[36],"root":[37],"a":[39,75,82,117],"directed":[40],"graph.":[41],"In":[42,70],"[L.":[43],"Lov\u00e1sz,":[44],"J.":[45],"Theory":[47],"Ser.":[48],"B,":[49],"21":[50],"(1976),":[51],"96--103],":[53],"Lov\u00e1sz":[54],"gave":[55],"an":[56,98],"elegant":[57],"alternative":[58],"proof":[59],"which":[60],"became":[61],"basis":[63],"many":[65],"extensions":[66],"result.":[69],"this":[71],"paper,":[72],"we":[73],"use":[74],"modification":[76],"Lov\u00e1sz's":[78],"method":[79],"to":[80],"prove":[81],"covering":[85],"intersecting":[86],"bi-set":[87],"families":[88],"under":[89],"matroid":[90],"constraints.":[91],"Our":[92],"result":[93],"can":[94],"be":[95],"considered":[96],"as":[97],"extension":[99],"previous":[101],"results":[102],"packing":[104],"arborescences.":[105],"We":[106],"also":[107],"investigate":[108],"algorithmic":[110],"aspects":[111],"problem":[114],"and":[115],"present":[116],"polynomial-time":[118],"algorithm":[119],"for":[120],"solving":[121],"corresponding":[123],"optimization":[124],"problem.":[125]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}