{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:21Z","timestamp":1740122421703,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,5,5]],"date-time":"2020-05-05T00:00:00Z","timestamp":1588636800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,5]],"date-time":"2020-05-05T00:00:00Z","timestamp":1588636800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772005"],"award-info":[{"award-number":["61772005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2017J01753"],"award-info":[{"award-number":["2017J01753"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10878-020-00579-z","type":"journal-article","created":{"date-parts":[[2020,5,5]],"date-time":"2020-05-05T18:03:21Z","timestamp":1588701801000},"page":"2085-2103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Exact algorithms for finding constrained minimum spanning trees"],"prefix":"10.1007","volume":"44","author":[{"given":"Pei","family":"Yao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2891-4253","authenticated-orcid":false,"given":"Longkun","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,5]]},"reference":[{"issue":"4","key":"579_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0305-0548(82)90026-0","volume":"9","author":"V Aggarwal","year":"1982","unstructured":"Aggarwal V, Aneja YP, Nair KPK (1982) Minimal spanning tree subject to a side constraint. Comput Oper Res 9(4):287\u2013296","journal-title":"Comput Oper Res"},{"issue":"6","key":"579_CR2","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1111\/j.1475-3995.1999.tb00176.x","volume":"6","author":"L Alfandari","year":"1999","unstructured":"Alfandari L, Paschos VT (1999) Approximating minimum spanning tree of depth 2. Int Trans Oper Res 6(6):607\u2013622","journal-title":"Int Trans Oper Res"},{"issue":"3","key":"579_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-015-9788-7","volume":"63","author":"LH Bicalho","year":"2016","unstructured":"Bicalho LH, Cunha ASD, Lucena A (2016) Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem. Comput Optim Appl 63(3):1\u201338","journal-title":"Comput Optim Appl"},{"issue":"3","key":"579_CR4","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/0167-8191(95)00010-0","volume":"22","author":"B Boldon","year":"1996","unstructured":"Boldon B, Deo N, Kumar N (1996) Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an simd parallel machine. Parallel Comput 22(3):369\u2013382","journal-title":"Parallel Comput"},{"issue":"1","key":"579_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0167-6377(98)00029-7","volume":"23","author":"G Dahl","year":"1998","unstructured":"Dahl G (1998) The 2-hop spanning tree problem. Oper Res Lett 23(1):21\u201326","journal-title":"Oper Res Lett"},{"key":"579_CR6","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1016\/j.asoc.2016.07.054","volume":"56","author":"X Gao","year":"2016","unstructured":"Gao X, Jia L (2016) Degree-constrained minimum spanning tree problem with uncertain edge weights. Appl Soft Comput 56:580\u2013588","journal-title":"Appl Soft Comput"},{"key":"579_CR7","doi-asserted-by":"crossref","unstructured":"Guo L, Liao K, Shen H, Li P (2015) Brief announcement: Efficient approximation algorithms for computing k disjoint restricted shortest paths. In: Proceedings of the 27th ACM on symposium on parallelism in algorithms and architectures, SPAA 2015, Portland, OR, USA, June 13\u201315, 2015, pp 62\u201364","DOI":"10.1145\/2755573.2755608"},{"issue":"2","key":"579_CR8","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1137\/S0097539703426775","volume":"33","author":"R Hassin","year":"2004","unstructured":"Hassin R, Levin A (2004) An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection. SIAM J Comput 33(2):261\u2013268","journal-title":"SIAM J Comput"},{"issue":"3","key":"579_CR9","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.orl.2003.06.003","volume":"32","author":"SP Hong","year":"2004","unstructured":"Hong SP, Chung SJ, Park BH (2004) A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. Oper Res Lett 32(3):233\u2013239","journal-title":"Oper Res Lett"},{"key":"579_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-21711-5","volume-title":"Combinatorial optimization","author":"B Korte","year":"2002","unstructured":"Korte B, Vygen J, Korte B, Vygen J (2002) Combinatorial optimization, vol 1. Springer, New York"},{"issue":"1","key":"579_CR11","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal JB (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. Proc Am Math Soc 7(1):48\u201350","journal-title":"Proc Am Math Soc"},{"key":"579_CR12","first-page":"660","volume":"651","author":"LC Lau","year":"2007","unstructured":"Lau LC, Singh M (2007) Iterative rounding and relaxation (combinatorial). ACM Symp Theory Comput (STOC) 651:660","journal-title":"ACM Symp Theory Comput (STOC)"},{"key":"579_CR13","doi-asserted-by":"crossref","unstructured":"Marathe M, Ravi R, Ravi S, Rosenkrantz D, Hunt H (1995) Bicriteria network design problems. In: Automata, languages and programming, pp 487\u2013498","DOI":"10.1007\/3-540-60084-1_99"},{"issue":"4","key":"579_CR14","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0305-0548(80)90022-2","volume":"7","author":"SC Narula","year":"1980","unstructured":"Narula SC, Ho CA (1980) Degree-constrained minimum spanning tree. Comput Oper Res 7(4):239\u2013249","journal-title":"Comput Oper Res"},{"issue":"6","key":"579_CR15","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"RC Prim","year":"1957","unstructured":"Prim RC (1957) Shortest connection networks and some generalizations. Bell Labs Tech J 36(6):1389\u20131401","journal-title":"Bell Labs Tech J"},{"key":"579_CR16","doi-asserted-by":"crossref","unstructured":"Ravi R, Goemans M (1996) The constrained minimum spanning tree problem. In: Algorithm theory SWAT\u201996, pp 66\u201375","DOI":"10.1007\/3-540-61422-2_121"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00579-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-020-00579-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00579-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T08:48:54Z","timestamp":1664354934000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-020-00579-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,5]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["579"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00579-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2020,5,5]]},"assertion":[{"value":"5 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}