{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:28:33Z","timestamp":1759847313673},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2003,12,5]],"date-time":"2003-12-05T00:00:00Z","timestamp":1070582400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1007\/s00453-003-1054-1","type":"journal-article","created":{"date-parts":[[2004,2,20]],"date-time":"2004-02-20T06:57:08Z","timestamp":1077260228000},"page":"529-537","source":"Crossref","is-referenced-by-count":8,"title":["Minimum k Arborescences with Bandwidth Constraints"],"prefix":"10.1007","volume":"38","author":[{"given":"Mao-cheng","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaotie","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,12,5]]},"reference":[{"key":"1054_CR1","unstructured":"R.K. Ahuja, T.L. MaGnanit and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993."},{"key":"1054_CR2","doi-asserted-by":"crossref","unstructured":"M.H. Ammar, S.Y. Cheung, and C.M. Scoglio, Routing multipoint connections using virtual paths in an ATM network, Proc. IEEE INFOCOM \u201893, pp. 98\u2013105, 1993.","DOI":"10.1109\/INFCOM.1993.253244"},{"key":"1054_CR3","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1109\/90.490746","volume":"4","author":"F. Bauer","year":"1996","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"1054_CR4","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1109\/TCOM.1983.1095818","volume":"31","author":"K. Bharath-Kumar","year":"1983","journal-title":"IEEE Trans. Commun."},{"key":"1054_CR5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/78952.78953","volume":"8","author":"S.E. Deering","year":"1990","journal-title":"ACM Trans. Comput. Systems"},{"key":"1054_CR6","doi-asserted-by":"crossref","first-page":"67","DOI":"10.6028\/jres.069B.004","volume":"69B","author":"J. Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"1054_CR7","unstructured":"J. Edmonds, Edge-disjoint branchings, in: Combinatorial Algorithm (R. Rustin, ed.), Academic Press, New York, 1973, pp. 91\u201396."},{"key":"1054_CR8","unstructured":"L.R. Ford and D.R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, NJ, 1962."},{"key":"1054_CR9","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S. Fortune","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"1054_CR10","first-page":"63","volume":"41","author":"A. Frank","year":"1979","journal-title":"Acta Sci. Math. (Szeged)"},{"key":"1054_CR11","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0196-6774(81)90032-8","volume":"2","author":"A. Frank","year":"1981","journal-title":"J. Algorithms"},{"key":"1054_CR12","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.","DOI":"10.1007\/978-3-642-97881-4"},{"key":"1054_CR13","doi-asserted-by":"crossref","unstructured":"V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, and M. Yannakakis, \u201cNear-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems\u201d, STOC99, pp. 19-28, 1999.","DOI":"10.1145\/301250.301262"},{"key":"1054_CR14","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1016\/S0140-3664(97)00081-9","volume":"20","author":"X. Jia","year":"1997","journal-title":"Comput. Commun."},{"key":"1054_CR15","unstructured":"E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart, & Winston, New York, 1975."},{"key":"1054_CR16","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0095-8956(76)90049-6","volume":"21","author":"L. Lov\u00e1sz","year":"1976","journal-title":"J. Combin. Theory Ser. B"},{"key":"1054_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jcss.1999.1661","volume":"60","author":"B. Ma","year":"2000","journal-title":"J. Comput. System Sci."},{"key":"1054_CR18","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0095-8956(78)90008-4","volume":"25","author":"C. McDiarmid","year":"1978","journal-title":"J. Combin. Theory Ser. B"},{"key":"1054_CR19","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/179606.179654","volume":"37","author":"J. Moy","year":"1994","journal-title":"Comm. ACM"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-003-1054-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-003-1054-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-003-1054-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:40:29Z","timestamp":1559122829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-003-1054-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12,5]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["1054"],"URL":"https:\/\/doi.org\/10.1007\/s00453-003-1054-1","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,12,5]]}}}