{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:13:12Z","timestamp":1761621192259,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126906"},{"type":"electronic","value":"9783319126913"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12691-3_46","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T21:11:32Z","timestamp":1415999492000},"page":"613-622","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Integer Programming Formulations for Minimum Spanning Forests and Connected Components in Sparse Graphs"],"prefix":"10.1007","author":[{"given":"Neng","family":"Fan","sequence":"first","affiliation":[]},{"given":"Mehdi","family":"Golari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"issue":"2","key":"46_CR1","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1090\/S0273-0979-09-01249-X","volume":"46","author":"G Carlsson","year":"2009","unstructured":"Carlsson, G.: Topology and data. Bull. Am. Math. Soc. 46(2), 255\u2013308 (2009)","journal-title":"Bull. Am. Math. Soc."},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"Cole, R., Klein, P.N., Tarjan, R.E.: Finding minimum spanning forests in logarithmic time and linear work using random sampling. In: SPAA \u201996 Proceedings of the Eighth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 243\u2013250 (1996)","DOI":"10.1145\/237502.237563"},{"issue":"6","key":"46_CR3","doi-asserted-by":"publisher","first-page":"1879","DOI":"10.1137\/S0097539700371065","volume":"31","author":"S Pettie","year":"2002","unstructured":"Pettie, S., Ramachandran, V.: A randomized time-work optimal parallel algorithm for finding a minimum spanning forest. SIAM J. Comput. 31(6), 1879\u20131895 (2002)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"46_CR4","first-page":"104","volume":"25","author":"PC Pop","year":"2009","unstructured":"Pop, P.C.: A survey of different integer programming formulations of the generalized minimum spanning tree problem. Carpathian J. Math. 25(1), 104\u2013118 (2009)","journal-title":"Carpathian J. Math."},{"key":"46_CR5","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J Edmonds","year":"1971","unstructured":"Edmonds, J.: Matroids and the greedy algorithm. Math. Program. 1, 127\u2013136 (1971)","journal-title":"Math. Program."},{"issue":"1","key":"46_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10288-010-0122-z","volume":"8","author":"M Conforti","year":"2010","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Extended formulations in combinatorial optimization. 4OR 8(1), 1\u201348 (2010)","journal-title":"4OR"},{"issue":"4","key":"46_CR7","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1002\/net.3230260407","volume":"26","author":"YS Myung","year":"1995","unstructured":"Myung, Y.S., Lee, C.H., Tcha, D.W.: On the generalized minimum spanning tree problem. Networks 26(4), 231\u2013241 (1995)","journal-title":"Networks"},{"issue":"1","key":"46_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/net.10009","volume":"39","author":"C Feremans","year":"2002","unstructured":"Feremans, C., Labbe, M., Laporte, G.: A comparative analysis of several formulations for the generalized minimum spanning tree problem. Networks 39(1), 29\u201334 (2002)","journal-title":"Networks"},{"key":"46_CR9","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0167-6377(91)90028-N","volume":"10","author":"RK Martin","year":"1991","unstructured":"Martin, R.K.: Using separation algorithms to generate mixed integer model reformulations. Oper. Res. Lett. 10, 119\u2013128 (1991)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"46_CR10","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/0022-0000(91)90024-Y","volume":"43","author":"M Yannakakis","year":"1991","unstructured":"Yannakakis, M.: Expressing combinatorial optimization problems by linear programs. J. Comput. Syst. Sci. 43(3), 441\u2013466 (1991)","journal-title":"J. Comput. Syst. Sci."},{"key":"46_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-13036-6_11","volume-title":"Integer Programming and Combinatorial Optimization","author":"V Kaibel","year":"2010","unstructured":"Kaibel, V., Pashkovich, K., Theis, D.O.: Symmetry matters for the sizes of extended formulations. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol. 6080, pp. 135\u2013148. Springer, Heidelberg (2010)"},{"issue":"1","key":"46_CR12","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1109\/TSG.2012.2229398","volume":"4","author":"DT Nguyen","year":"2013","unstructured":"Nguyen, D.T., Shen, Y., Thai, M.T.: Detecting critical nodes in interdependent power networks for vulnerability assessment. IEEE Trans. Smart Grid 4(1), 151\u2013159 (2013)","journal-title":"IEEE Trans. Smart Grid"}],"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-12691-3_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T00:10:21Z","timestamp":1676419821000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"13 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}