{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T10:30:06Z","timestamp":1769164206301,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s10878-024-01219-6","type":"journal-article","created":{"date-parts":[[2024,10,7]],"date-time":"2024-10-07T12:07:29Z","timestamp":1728302849000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Matroid-rooted packing of arborescences"],"prefix":"10.1007","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2982-1737","authenticated-orcid":false,"given":"Zolt\u00e1n","family":"Szigeti","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,7]]},"reference":[{"issue":"3","key":"1219_CR1","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1287\/moor.2017.0881","volume":"43","author":"K B\u00e9rczi","year":"2018","unstructured":"B\u00e9rczi K, Frank A (2018) Supermodularity in unweighted graph optimization I: branchings and matchings. Math Oper Res 43(3):726\u2013753","journal-title":"Math Oper Res"},{"key":"1219_CR2","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1002\/jgt.3190070213","volume":"7","author":"MC Cai","year":"1983","unstructured":"Cai MC (1983) Arc-disjoint arborescences of digraphs. J Graph Theory 7:235\u2013240","journal-title":"J Graph Theory"},{"issue":"1","key":"1219_CR3","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1137\/120883761","volume":"27","author":"O Durand de Gevigney","year":"2013","unstructured":"Durand de Gevigney O, Nguyen VH, Szigeti Z (2013) Matroid-based packing of arborescences. SIAM J Discret Math 27(1):567\u2013574","journal-title":"SIAM J Discret Math"},{"key":"1219_CR4","first-page":"91","volume-title":"Combinatorial algorithms","author":"J Edmonds","year":"1973","unstructured":"Edmonds J (1973) Edge-disjoint branchings. In: Rustin B (ed) Combinatorial algorithms. Academic Press, New York, pp 91\u201396"},{"key":"1219_CR5","doi-asserted-by":"crossref","unstructured":"Fortier Q, Kir\u00e1ly Cs, L\u00e9onard M, Szigeti Z, Talon A (2018) Old and new results on packing arborescences. Discret Appl Math 242:26\u201333","DOI":"10.1016\/j.dam.2017.11.004"},{"key":"1219_CR6","doi-asserted-by":"crossref","unstructured":"Fortier Q, Kir\u00e1ly Cs, Szigeti Z, Tanigawa S (2020) On packing spanning arborescences with matroid constraint. J Graph Theory 93(2):230\u2013252","DOI":"10.1002\/jgt.22484"},{"key":"1219_CR7","unstructured":"Frank A (1978) On disjoint trees and arborescences. In: Algebraic methods in graph theory, vol 25, Norh-Holland, Colloquia Mathematica Soc J Bolyai, pp 159\u2013169"},{"key":"1219_CR8","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/B978-0-444-86893-0.50021-8","volume-title":"Finite and infinite sets","author":"A Frank","year":"1984","unstructured":"Frank A (1984) Generalized polymatroids. In: Hajnal A et al (eds) Finite and infinite sets. North-Holland, Amsterdam-New York, pp 285\u2013294"},{"key":"1219_CR9","volume-title":"Connections in combinatorial optimization","author":"A Frank","year":"2011","unstructured":"Frank A (2011) Connections in combinatorial optimization. Oxford University Press, Oxford"},{"key":"1219_CR10","unstructured":"Frank A (2013) Personal communication"},{"issue":"2","key":"1219_CR11","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/S0166-218X(02)00462-6","volume":"131","author":"A Frank","year":"2003","unstructured":"Frank A, Kir\u00e1ly T, Kir\u00e1ly Z (2003) On the orientation of graphs and hypergraphs. Discret Appl Math 131(2):385\u2013400","journal-title":"Discret Appl Math"},{"key":"1219_CR12","doi-asserted-by":"crossref","unstructured":"Gao H (2024) Covering a supermodular-like function in a mixed hypergraph. arxiv: 2402.05458v1","DOI":"10.2139\/ssrn.5009081"},{"issue":"2","key":"1219_CR13","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1002\/jgt.22702","volume":"98","author":"H Gao","year":"2021","unstructured":"Gao H, Yang D (2021) Packing of spanning mixed arborescences. J Graph Theory 98(2):367\u2013377","journal-title":"J Graph Theory"},{"issue":"1","key":"1219_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.3230120102","volume":"12","author":"R Hassin","year":"1982","unstructured":"Hassin R (1982) Minimum cost flow with set-constraints. Networks 12(1):1\u201321","journal-title":"Networks"},{"key":"1219_CR15","doi-asserted-by":"publisher","DOI":"10.37236\/10105","author":"F H\u00f6rsch","year":"2021","unstructured":"H\u00f6rsch F, Szigeti Z (2021) Packing of mixed hyperarborescences with flexible roots via matroid intersection. Electron J Combin. https:\/\/doi.org\/10.37236\/10105","journal-title":"Electron J Combin"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01219-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01219-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01219-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T05:23:45Z","timestamp":1732857825000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01219-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["1219"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01219-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10]]},"assertion":[{"value":"22 September 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The author has no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"19"}}