{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:36:16Z","timestamp":1725795376899},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319079585"},{"type":"electronic","value":"9783319079592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07959-2_7","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T12:44:25Z","timestamp":1402404265000},"page":"74-86","source":"Crossref","is-referenced-by-count":0,"title":["Implementation of the Iterative Relaxation Algorithm for the Minimum Bounded-Degree Spanning Tree Problem"],"prefix":"10.1007","author":[{"given":"Attila","family":"Bern\u00e1th","sequence":"first","affiliation":[]},{"given":"Krzysztof","family":"Ciebiera","sequence":"additional","affiliation":[]},{"given":"Piotr","family":"Godlewski","sequence":"additional","affiliation":[]},{"given":"Piotr","family":"Sankowski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"7_CR1","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1016\/j.dam.2005.06.011","volume":"154","author":"R. Andrade","year":"2006","unstructured":"Andrade, R., Lucena, A., Maculan, N.: Using Lagrangian dual information to generate degree constrained spanning trees. Discrete Appl. Math.\u00a0154(5), 703\u2013717 (2006), \n                    \n                      http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X0500301X","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"7_CR2","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.\u00a022(3), 369\u2013382 (1996)","journal-title":"Parallel Comput."},{"key":"7_CR3","unstructured":"CPLEX, I.I.: High performance mathematical programming engine, \n                    \n                      http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer"},{"key":"7_CR4","first-page":"879","volume-title":"Proceedings of the 6th Annual Allerton Conference","author":"N. Deo","year":"1968","unstructured":"Deo, N., Hakimi, S.: The shortest generalized hamiltonian tree. In: Proceedings of the 6th Annual Allerton Conference, pp. 879\u2013888. University of Illinois, Illinois (1968)"},{"issue":"1","key":"7_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.\u00a01(1), 127\u2013136 (1971)","journal-title":"Math. Program."},{"issue":"3","key":"7_CR6","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/jagm.1994.1042","volume":"17","author":"M. Furer","year":"1994","unstructured":"Furer, M., Raghavachari, B.: Approximating the minimum-degree Steiner tree to within one of optimal. J. Algorithm\u00a017(3), 409\u2013423 (1994)","journal-title":"J. Algorithm"},{"key":"7_CR7","first-page":"273","volume-title":"FOCS 2006","author":"M.X. Goemans","year":"2006","unstructured":"Goemans, M.X.: Minimum bounded degree spanning trees. In: FOCS 2006, pp. 273\u2013282. IEEE Computer Society, Los Alamitos (2006)"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science\u00a0220, 671\u2013680 (1983)","journal-title":"Science"},{"issue":"6","key":"7_CR9","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1023\/A:1011977126230","volume":"7","author":"M. Krishnamoorthy","year":"2001","unstructured":"Krishnamoorthy, M., Ernst, A.T., Sharaiha, Y.M.: Comparison of algorithms for the degree constrained minimum spanning tree. J. Heuristics\u00a07(6), 587\u2013611 (2001)","journal-title":"J. Heuristics"},{"key":"7_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511977152","volume-title":"Iterative methods in combinatorial optimization","author":"L.C. Lau","year":"2011","unstructured":"Lau, L.C., Ravi, R., Singh, M.: Iterative methods in combinatorial optimization. Cambridge University Press, Cambridge (2011)"},{"key":"7_CR11","unstructured":"Library for Efficient Modeling and Optimization in Networks (LEMON), \n                    \n                      http:\/\/lemon.cs.elte.hu"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0305-0548(80)90022-2","volume":"7","author":"S. Narula","year":"1980","unstructured":"Narula, S., Ho, C.: Degree-constrained minimum spanning tree. Comput. Oper. Res.\u00a07, 239\u2013249 (1980)","journal-title":"Comput. Oper. Res."},{"key":"7_CR13","unstructured":"Practical Approximation Algorithms Library (PAAL), \n                    \n                      http:\/\/paal.mimuw.edu.pl"},{"key":"7_CR14","first-page":"438","volume-title":"STOC 1993","author":"R. Ravi","year":"1993","unstructured":"Ravi, R., Marathe, M.V., Ravi, S.S., Rosenkrantz, D.J., Hunt III, H.B.: Many birds with one stone: Multi-objective approximation algorithms. In: STOC 1993, pp. 438\u2013447. ACM, New York (1993), \n                    \n                      http:\/\/doi.acm.org\/10.1145\/167088.167209"},{"key":"7_CR15","first-page":"661","volume-title":"STOC 2007","author":"M. Singh","year":"2007","unstructured":"Singh, M., Lau, L.C.: Approximating minimum bounded degree spanning trees to within one of optimal. In: STOC 2007, pp. 661\u2013670. ACM, New York (2007)"},{"issue":"12","key":"7_CR16","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1080\/03052150802317440","volume":"40","author":"M.S. Zahrani","year":"2008","unstructured":"Zahrani, M.S., Loomes, M.J., Malcolm, J.A., Albrecht, A.A.: A local search heuristic for bounded-degree minimum spanning trees. Eng. Optimiz.\u00a040(12), 1115\u20131135 (2008), \n                    \n                      http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/03052150802317440","journal-title":"Eng. Optimiz."}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07959-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T21:56:36Z","timestamp":1558907796000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07959-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079585","9783319079592"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07959-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}