{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:13:24Z","timestamp":1743016404408,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319711492"},{"type":"electronic","value":"9783319711508"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-71150-8_9","type":"book-chapter","created":{"date-parts":[[2017,11,16]],"date-time":"2017-11-16T00:48:21Z","timestamp":1510793301000},"page":"103-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Approximation Algorithms for Computing Constrained Minimum Spanning Trees"],"prefix":"10.1007","author":[{"given":"Pei","family":"Yao","sequence":"first","affiliation":[]},{"given":"Longkun","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,17]]},"reference":[{"issue":"4","key":"9_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, Y.P., Nair, K.P.K.: Minimal spanning tree subject to a side constraint. Comput. Operat. Res. 9(4), 287\u2013296 (1982)","journal-title":"Comput. Operat. Res."},{"issue":"6","key":"9_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, V.T.: Approximating minimum spanning tree of depth 2. Int. Trans. Oper. Res. 6(6), 607\u2013622 (1999)","journal-title":"Int. Trans. Oper. Res."},{"issue":"3","key":"9_CR3","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.: Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an simd parallel machine. Parallel Comput. 22(3), 369\u2013382 (1996)","journal-title":"Parallel Comput."},{"issue":"1","key":"9_CR4","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.: The 2-hop spanning tree problem. Oper. Res. Lett. 23(1), 21\u201326 (1998)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Guo, L., Liao, K., Shen, H., Li, P.: 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, 13\u201315 June 2015, pp. 62\u201364 (2015)","DOI":"10.1145\/2755573.2755608"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7(1), 48\u201350 (1956)","journal-title":"Proc. Am. Math. Soc."},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.endm.2010.05.029","volume":"36","author":"V Leggieri","year":"2010","unstructured":"Leggieri, V., Haouari, M., Triki, C.: An exact algorithm for the steiner tree problem with delays. Electron. Notes Discrete Math. 36, 223\u2013230 (2010)","journal-title":"Electron. Notes Discrete Math."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Marathe, M., Ravi, R., Sundaram, R., Ravi, S., Rosenkrantz, D., Hunt, H.: Bicriteria network design problems. In: Automata, Languages and Programming, pp. 487\u201349 (1995)","DOI":"10.1007\/3-540-60084-1_99"},{"issue":"4","key":"9_CR10","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0305-0548(80)90022-2","volume":"7","author":"SC Narula","year":"1980","unstructured":"Narula, S.C., Ho, C.A.: Degree-constrained minimum spanning tree. Comput. Oper. Res. 7(4), 239\u2013249 (1980)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"9_CR11","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, R.C.: Shortest connection networks and some generalizations. Bell Labs Tech. J. 36(6), 1389\u20131401 (1957)","journal-title":"Bell Labs Tech. J."},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s00453-001-0038-2","volume":"31","author":"R Ravi","year":"2001","unstructured":"Ravi, R., Marathe, M.V., Ravi, S.S., Rosenkrantz, D.J., Hunt III, H.B.: Approximation algorithms for degree-constrained minimum-cost network-design problems. Algorithmica 31(1), 58\u201378 (2001)","journal-title":"Algorithmica"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/3-540-61422-2_121","volume-title":"Algorithm Theory \u2014 SWAT\u201996","author":"R Ravi","year":"1996","unstructured":"Ravi, R., Goemans, M.X.: The constrained minimum spanning tree problem. In: Karlsson, R., Lingas, A. (eds.) SWAT 1996. LNCS, vol. 1097, pp. 66\u201375. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61422-2_121"},{"key":"9_CR14","unstructured":"Sollin, M.: Le trace de canalisation. In: Berge, C., Ghouilla-Houri, A. (eds.) Programming, Games, and Transportation Networks. Wiley, New York (1965)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71150-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T13:46:05Z","timestamp":1709819165000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-71150-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319711492","9783319711508"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71150-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"17 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/anl.sjtu.edu.cn\/cocoa2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}