乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:21:46Z","timestamp":1720052506099},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC, China","doi-asserted-by":"publisher","award":["11871439"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1016\/j.dam.2020.11.009","type":"journal-article","created":{"date-parts":[[2020,11,20]],"date-time":"2020-11-20T18:05:10Z","timestamp":1605895510000},"page":"313-319","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Packing of maximal independent mixed arborescences"],"prefix":"10.1016","volume":"289","author":[{"given":"Hui","family":"Gao","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-6030-2372","authenticated-orcid":false,"given":"Daqing","family":"Yang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2020.11.009_b1","series-title":"Building Bridges Between Mathematics and Computer Science","first-page":"137","article-title":"Variations for Lov\u00e1sz\u2019 submodular ideas","volume":"vol. 19","author":"B\u00e9rczi","year":"2008"},{"key":"10.1016\/j.dam.2020.11.009_b2","series-title":"RIMS Kokyuroku Bessatsu B23: Combinatorial Optimization and Discrete Algorithms","first-page":"1","article-title":"Packing arborescences","author":"B\u00e9rczi","year":"2010"},{"issue":"3","key":"10.1016\/j.dam.2020.11.009_b3","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1287\/moor.2017.0881","article-title":"Supermodularity in unweighted graph optimization I: Branchings and matchings","volume":"43","author":"B\u00e9rczi","year":"2018","journal-title":"Math. Oper. Res."},{"issue":"3","key":"10.1016\/j.dam.2020.11.009_b4","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1287\/moor.2017.0902","article-title":"Supermodularity in unweighted graph optimization II: Matroidal term rank augmentation","volume":"43","author":"B\u00e9rczi","year":"2018","journal-title":"Math. Oper. Res."},{"issue":"3","key":"10.1016\/j.dam.2020.11.009_b5","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1287\/moor.2017.0883","article-title":"Supermodularity in unweighted graph optimization III: Highly-connected digraphs","volume":"43","author":"B\u00e9rczi","year":"2018","journal-title":"Math. Oper. Res."},{"issue":"3","key":"10.1016\/j.dam.2020.11.009_b6","doi-asserted-by":"crossref","first-page":"1758","DOI":"10.1137\/15M1049099","article-title":"Covering intersecting bi-set families under matroid constraints","volume":"30","author":"B\u00e9rczi","year":"2016","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.dam.2020.11.009_b7","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1137\/120883761","article-title":"Matroid-based packing of arborescences","volume":"27","author":"Durand de Gevigney","year":"2013","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.dam.2020.11.009_b8","series-title":"Combinatorial Algorithms (Courant Comput. Sci. Sympos. 9, New York Univ. New York, 1972)","first-page":"91","article-title":"Edge-disjoint branchings","author":"Edmonds","year":"1973"},{"key":"10.1016\/j.dam.2020.11.009_b9","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.dam.2017.11.004","article-title":"Old and new results on packing arborescences in directed hypergraphs","volume":"242","author":"Fortier","year":"2018","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2020.11.009_b10","series-title":"Algebraic Methods in Graph Theory","first-page":"159","article-title":"On disjoint trees and arborescences","volume":"vol. 25","author":"Frank","year":"1978"},{"key":"10.1016\/j.dam.2020.11.009_b11","series-title":"Connections in Combinatorial Optimization","author":"Frank","year":"2011"},{"key":"10.1016\/j.dam.2020.11.009_b12","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2020.103212","article-title":"Packing branchings under cardinality constraints on their root sets","volume":"91","author":"Gao","year":"2021","journal-title":"European J. Combin."},{"key":"10.1016\/j.dam.2020.11.009_b13","series-title":"Reachability in arborescence packings","author":"H\u00f6rsch","year":"2020"},{"key":"10.1016\/j.dam.2020.11.009_b14","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s00493-009-2428-z","article-title":"Arc-disjoint in-trees in directed graphs","volume":"29","author":"Kamiyama","year":"2009","journal-title":"Combinatorica"},{"key":"10.1016\/j.dam.2020.11.009_b15","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1137\/110846944","article-title":"Rooted-tree decompositions with matroid constraints and the infinitesimal rigidity of frameworks with boundaries","volume":"27","author":"Katoh","year":"2013","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"10.1016\/j.dam.2020.11.009_b16","doi-asserted-by":"crossref","first-page":"2107","DOI":"10.1137\/130938396","article-title":"On maximal independent arborescence packing","volume":"30","author":"Kir\u00e1ly","year":"2016","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"10.1016\/j.dam.2020.11.009_b17","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s10107-019-01377-0","article-title":"Packing of arborescences with matroid constraints via matroid intersection","volume":"181","author":"Kir\u00e1ly","year":"2020","journal-title":"Math. Program."},{"key":"10.1016\/j.dam.2020.11.009_b18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.disopt.2018.10.002","article-title":"On reachability mixed arborescence packing","volume":"32","author":"Matsuoka","year":"2019","journal-title":"Discrete Optim."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X20304996?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X20304996?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,12,8]],"date-time":"2020-12-08T05:27:21Z","timestamp":1607405241000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X20304996"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":18,"alternative-id":["S0166218X20304996"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2020.11.009","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Packing of maximal independent mixed arborescences","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2020.11.009","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}