{"id":"https://openalex.org/W2062251071","doi":"https://doi.org/10.1137/120883761","title":"Matroid-Based Packing of Arborescences","display_name":"Matroid-Based Packing of Arborescences","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2062251071","doi":"https://doi.org/10.1137/120883761","mag":"2062251071"},"language":"en","primary_location":{"id":"doi:10.1137/120883761","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120883761","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034589526","display_name":"Olivier Durand de Gevigney","orcid":"https://orcid.org/0000-0002-6789-3777"},"institutions":[{"id":"https://openalex.org/I4210094718","display_name":"Laboratoire des Sciences pour la Conception, l'Optimisation et la Production","ror":"https://ror.org/00rv5x925","country_code":"FR","type":"facility","lineage":["https://openalex.org/I106785703","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210094718","https://openalex.org/I4210159245","https://openalex.org/I899635006","https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Olivier Durand de Gevigney","raw_affiliation_strings":["G-SCOP_OC - Optimisation Combinatoire (46 Avenue F\u00e9lix Viallet 38001 GRENOBLE Cedex 1 - France)"],"affiliations":[{"raw_affiliation_string":"G-SCOP_OC - Optimisation Combinatoire (46 Avenue F\u00e9lix Viallet 38001 GRENOBLE Cedex 1 - France)","institution_ids":["https://openalex.org/I4210094718"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109089406","display_name":"Viet-Hang Nguyen","orcid":null},"institutions":[{"id":"https://openalex.org/I4210094718","display_name":"Laboratoire des Sciences pour la Conception, l'Optimisation et la Production","ror":"https://ror.org/00rv5x925","country_code":"FR","type":"facility","lineage":["https://openalex.org/I106785703","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210094718","https://openalex.org/I4210159245","https://openalex.org/I899635006","https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Viet-Hang Nguyen","raw_affiliation_strings":["G-SCOP_OC - Optimisation Combinatoire (46 Avenue F\u00e9lix Viallet 38001 GRENOBLE Cedex 1 - France)"],"affiliations":[{"raw_affiliation_string":"G-SCOP_OC - Optimisation Combinatoire (46 Avenue F\u00e9lix Viallet 38001 GRENOBLE Cedex 1 - France)","institution_ids":["https://openalex.org/I4210094718"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058632146","display_name":"Zolt\u00e1n Szigeti","orcid":"https://orcid.org/0000-0003-2982-1737"},"institutions":[{"id":"https://openalex.org/I4210094718","display_name":"Laboratoire des Sciences pour la Conception, l'Optimisation et la Production","ror":"https://ror.org/00rv5x925","country_code":"FR","type":"facility","lineage":["https://openalex.org/I106785703","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210094718","https://openalex.org/I4210159245","https://openalex.org/I899635006","https://openalex.org/I899635006"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Zolt\u00e1n Szigeti","raw_affiliation_strings":["G-SCOP_OC - Optimisation Combinatoire (46 Avenue F\u00e9lix Viallet 38001 GRENOBLE Cedex 1 - France)"],"affiliations":[{"raw_affiliation_string":"G-SCOP_OC - Optimisation Combinatoire (46 Avenue F\u00e9lix Viallet 38001 GRENOBLE Cedex 1 - France)","institution_ids":["https://openalex.org/I4210094718"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5034589526"],"corresponding_institution_ids":["https://openalex.org/I4210094718"],"apc_list":null,"apc_paid":null,"fwci":1.4502,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.82472081,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"27","issue":"1","first_page":"567","last_page":"574"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9993000030517578,"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.9979000091552734,"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.9674203395843506},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7991247177124023},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7820159792900085},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.644790768623352},{"id":"https://openalex.org/keywords/weighted-matroid","display_name":"Weighted matroid","score":0.6002029776573181},{"id":"https://openalex.org/keywords/matroid-partitioning","display_name":"Matroid partitioning","score":0.5316800475120544},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4899972975254059},{"id":"https://openalex.org/keywords/graphic-matroid","display_name":"Graphic matroid","score":0.45758381485939026},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.447290301322937},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43786317110061646},{"id":"https://openalex.org/keywords/oriented-matroid","display_name":"Oriented matroid","score":0.43622398376464844},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10728287696838379}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.9674203395843506},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7991247177124023},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7820159792900085},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.644790768623352},{"id":"https://openalex.org/C124344645","wikidata":"https://www.wikidata.org/wiki/Q7979897","display_name":"Weighted matroid","level":5,"score":0.6002029776573181},{"id":"https://openalex.org/C22425182","wikidata":"https://www.wikidata.org/wiki/Q6787906","display_name":"Matroid partitioning","level":4,"score":0.5316800475120544},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4899972975254059},{"id":"https://openalex.org/C111034964","wikidata":"https://www.wikidata.org/wiki/Q5597156","display_name":"Graphic matroid","level":3,"score":0.45758381485939026},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.447290301322937},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43786317110061646},{"id":"https://openalex.org/C178621168","wikidata":"https://www.wikidata.org/wiki/Q16155113","display_name":"Oriented matroid","level":4,"score":0.43622398376464844},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10728287696838379},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/120883761","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120883761","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:HAL:hal-00903931v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00903931","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Discrete Mathematics, 2013, 27 (No. 1,), pp. 567-574","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1968903162","https://openalex.org/W2010006094","https://openalex.org/W2012329067","https://openalex.org/W2027758271","https://openalex.org/W2035575256","https://openalex.org/W2042706982","https://openalex.org/W2058858486","https://openalex.org/W2128059732","https://openalex.org/W2962695452"],"related_works":["https://openalex.org/W2400862597","https://openalex.org/W2153065381","https://openalex.org/W1984819493","https://openalex.org/W2058489697","https://openalex.org/W2159059797","https://openalex.org/W2625145881","https://openalex.org/W2072414647","https://openalex.org/W4246417054","https://openalex.org/W2106233458","https://openalex.org/W4226057593"],"abstract_inverted_index":{"We":[0,83],"provide":[1],"the":[2,90,94,98,106,111],"directed":[3],"counterpart":[4],"of":[5,9,35,45,57,66,79,89,93,97,101,110],"a":[6,33,42,62,86],"slight":[7],"extension":[8,44],"Katoh":[10,80],"and":[11,60,81,103],"Tanigawa's":[12],"result":[13,29,47,65,78],"[SIAM":[14],"J.":[15],"Discrete":[16],"Math.,":[17],"27":[18],"(2013),":[19],"pp.":[20,75],"155--185]":[21],"on":[22,55],"rooted-tree":[23],"decompositions":[24],"with":[25,37],"matroid":[26,38],"constraints.":[27,39],"Our":[28],"characterizes":[30],"digraphs":[31],"having":[32],"packing":[34,56],"arborescences":[36,59,102],"It":[40],"is":[41],"proper":[43],"Edmonds'":[46],"[Combinatorial":[48],"Algorithms,":[49],"Algorithmics":[50],"Press,":[51],"New":[52],"York,":[53],"1973]":[54],"spanning":[58],"implies---using":[61],"general":[63],"orientation":[64],"Frank":[67],"[J.":[68],"Combin.":[69],"Theory":[70],"Ser.":[71],"B,":[72],"28":[73],"(1980),":[74],"251--261]---the":[76],"above":[77],"Tanigawa.":[82],"also":[84],"give":[85],"complete":[87],"description":[88],"convex":[91],"hull":[92],"incidence":[95],"vectors":[96],"matroid-based":[99],"packings":[100],"prove":[104],"that":[105],"minimum":[107],"cost":[108],"version":[109],"problem":[112],"can":[113],"be":[114],"solved":[115],"in":[116],"polynomial":[117],"time.":[118]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}