{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T23:07:57Z","timestamp":1760828877898},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,1,9]],"date-time":"2013-01-09T00:00:00Z","timestamp":1357689600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s11227-012-0851-1","type":"journal-article","created":{"date-parts":[[2013,1,8]],"date-time":"2013-01-08T18:25:12Z","timestamp":1357669512000},"page":"226-249","source":"Crossref","is-referenced-by-count":12,"title":["Degree constrained minimum spanning tree problem: a learning automata approach"],"prefix":"10.1007","volume":"64","author":[{"given":"Javad","family":"Akbari\u00a0Torkestani","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,1,9]]},"reference":[{"key":"851_CR1","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"issue":"2","key":"851_CR2","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0196-6774(84)90029-4","volume":"5","author":"CH Papadimitriou","year":"1984","unstructured":"Papadimitriou CH, Vazirani UV (1984) On two geometric problems related to the travelling salesman problem. J Algorithms 5(2):231\u2013246","journal-title":"J Algorithms"},{"key":"851_CR3","volume-title":"Approximate solution of NP-hard optimization problems","author":"G Ausiello","year":"1999","unstructured":"Ausiello G, Crescenzi P, Gambosi G, Kann V, Marchetti Spaccamela A, Protasi M (1999) Approximate solution of NP-hard optimization problems. Springer, Berlin"},{"key":"851_CR4","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF02293049","volume":"8","author":"C Monma","year":"1992","unstructured":"Monma C, Suri S (1992) Transitions in geometric minimum spanning trees. Discrete Comput Geom 8:265\u2013293","journal-title":"Discrete Comput Geom"},{"issue":"4","key":"851_CR5","first-page":"1081","volume":"24","author":"Y-T Bau","year":"2008","unstructured":"Bau Y-T, Ho C-K, Ewe H-T (2008) Ant colony optimization approaches to the degree-constrained minimum spanning tree problem. J Inf Sci Eng 24(4):1081\u20131094","journal-title":"J Inf Sci Eng"},{"key":"851_CR6","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1016\/j.ejor.2006.12.061","volume":"191","author":"MC Souza de","year":"2008","unstructured":"de Souza MC, Martins P (2008) Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem. Eur J Oper Res 191:677\u2013690","journal-title":"Eur J Oper Res"},{"key":"851_CR7","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1023\/A:1011977126230","volume":"7","author":"M Krishnamoorthy","year":"2001","unstructured":"Krishnamoorthy M, Ernst AT (2001) Comparison of algorithms for the degree constrained minimum spanning tree. J Heuristics 7:587\u2013611","journal-title":"J Heuristics"},{"key":"851_CR8","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1007\/11596448_97","volume-title":"Computational intelligence and security","author":"Y-T Bau","year":"2005","unstructured":"Bau Y-T, Ho C-K, Ewe H-T (2005) An ant colony optimization approach to the degree-constrained minimum spanning tree problem. In: Computational intelligence and security. Lecture notes in computer science, vol 3801. Springer, Berlin, pp 657\u2013662"},{"key":"851_CR9","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1007\/978-3-540-30132-5_128","volume-title":"Knowledge-based intelligent information and engineering systems","author":"S-M Soak","year":"2004","unstructured":"Soak S-M, Corne D, Ahn B-H (2004) A new encoding for the degree constrained minimum spanning tree problem. In: Knowledge-based intelligent information and engineering systems. Lecture notes in computer science, vol\u00a03213, pp\u00a0952\u2013958"},{"key":"851_CR10","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"1077","DOI":"10.1007\/978-3-540-89197-0_110","volume-title":"Trends in artificial intelligence","author":"HTT Binh","year":"2008","unstructured":"Binh HTT, Nguyen TB (2008) New particle swarm optimization algorithm for solving degree constrained minimum spanning tree problem. In: Trends in artificial intelligence. Lecture notes in computer science, vol 5351, pp 1077\u20131085"},{"key":"851_CR11","first-page":"104","volume-title":"Proceedings of the 2000 congress on evolutionary computation","author":"GR Raidl","year":"2000","unstructured":"Raidl GR (2000) An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem. In: Proceedings of the 2000 congress on evolutionary computation, pp 104\u2013111"},{"key":"851_CR12","doi-asserted-by":"crossref","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 (2006) Using Lagrangian dual information to generate degree constrained spanning trees. Discrete Appl Math 154:703\u2013717","journal-title":"Discrete Appl Math"},{"issue":"7A","key":"851_CR13","first-page":"50","volume":"6","author":"L Hanr","year":"2006","unstructured":"Hanr L, Wang Y (2006) A novel genetic algorithm for degree-constrained minimum spanning tree problem. Int J Comput Sci Netw Secur 6(7A):50\u201357","journal-title":"Int J Comput Sci Netw Secur"},{"key":"851_CR14","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1145\/335603.335888","volume-title":"Proceedings of the 2000 ACM symposium on applied computing","author":"GR Raidl","year":"2000","unstructured":"Raidl GR, Julstrom BA (2000) A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem. In: Proceedings of the 2000 ACM symposium on applied computing, pp 440\u2013445"},{"key":"851_CR15","first-page":"11","volume-title":"Proceedings of the 8th annual conference on genetic and evolutionary computation","author":"TN Bui","year":"2006","unstructured":"Bui TN, Zrncic CM (2006) An ant-based algorithm for finding degree-constrained minimum spanning tree. In: Proceedings of the 8th annual conference on genetic and evolutionary computation, pp 11\u201318"},{"key":"851_CR16","doi-asserted-by":"crossref","first-page":"2969","DOI":"10.1016\/j.cor.2009.01.013","volume":"36","author":"P Martins","year":"2009","unstructured":"Martins P, de Souza MC (2009) VNS and second order heuristics for the min-degree constrained minimum spanning tree problem. Comput Oper Res 36:2969\u20132982","journal-title":"Comput Oper Res"},{"key":"851_CR17","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/j.pnsc.2007.11.014","volume":"18","author":"A Ning","year":"2008","unstructured":"Ning A, Ma L, Xiong X (2008) A new algorithm for degree-constrained minimum spanning tree based on the reduction technique. Prog Nat Sci 18:495\u2013499","journal-title":"Prog Nat Sci"},{"key":"851_CR18","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0377-2217(03)00071-7","volume":"156","author":"R Kawatra","year":"2004","unstructured":"Kawatra R, Bricker D (2004) Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs. Eur J Oper Res 156:73\u201382","journal-title":"Eur J Oper Res"},{"key":"851_CR19","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0166-218X(01)00255-4","volume":"118","author":"CC Ribeiro","year":"2002","unstructured":"Ribeiro CC, Souza MC (2002) Variable neighborhood search for the degree-constrained minimum spanning tree problem. Discrete Appl Math 118:43\u201354","journal-title":"Discrete Appl Math"},{"key":"851_CR20","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0377-2217(89)90169-0","volume":"39","author":"A Volgenant","year":"1989","unstructured":"Volgenant A (1989) A Lagrangean approach to the degree-constrained minimum spanning tree problem. Eur J Oper Res 39:325\u2013331","journal-title":"Eur J Oper Res"},{"key":"851_CR21","first-page":"1391","volume-title":"Proceedings of IEEE congress on evolutionary computation","author":"TL Pereira","year":"2009","unstructured":"Pereira TL, Carrano EG, Takahashi RHC, Wanner EF, Neto OM (2009) Continuous-space embedding genetic algorithm applied to the degree constrained minimum spanning tree problem. In: Proceedings of IEEE congress on evolutionary computation, pp 1391\u20131398"},{"key":"851_CR22","first-page":"485","volume-title":"Proceedings of IEEE congress on evolutionary computation","author":"MN Doan","year":"2007","unstructured":"Doan MN (2007) An effective ant-based algorithm for the degree-constrained minimum spanning tree problem. In: Proceedings of IEEE congress on evolutionary computation, pp 485\u2013491"},{"key":"851_CR23","first-page":"2683","volume-title":"Proceedings of IEEE international conference on systems, man, and cybernetics","author":"G Zhou","year":"1996","unstructured":"Zhou G, Gen M, Wu T (1996) A new approach to the degree-constrained minimum spanning tree problem using genetic algorithm. In: Proceedings of IEEE international conference on systems, man, and cybernetics, pp 2683\u20132688"},{"key":"851_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/CEC.2010.5585939","volume-title":"Proceedings of IEEE congress on evolutionary computation","author":"AT Ernst","year":"2010","unstructured":"Ernst AT (2010) A hybrid Lagrangian particle swarm optimization algorithm for the degree-constrained minimum spanning tree problem. In: Proceedings of IEEE congress on evolutionary computation, pp 1\u20138"},{"key":"851_CR25","first-page":"420","volume-title":"Proceedings of IEEE congress on evolutionary computation","author":"EFG Goldbarg","year":"2006","unstructured":"Goldbarg EFG, de Souza GR, Goldbarg MC (2006) Particle swarm optimization for the bi-objective degree constrained minimum spanning tree. In: Proceedings of IEEE congress on evolutionary computation, pp 420\u2013427"},{"key":"851_CR26","first-page":"218","volume-title":"Proceedings of fifth international conference on computational intelligence and multimedia applications","author":"Y Zeng","year":"2003","unstructured":"Zeng Y, Wang Y-P (2003) A new genetic algorithm with local search method for degree-constrained minimum spanning tree problem. In: Proceedings of fifth international conference on computational intelligence and multimedia applications, pp 218\u2013222"},{"issue":"2","key":"851_CR27","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1109\/TEVC.2011.2125971","volume":"16","author":"TN Bui","year":"2012","unstructured":"Bui TN, Deng X, Zrncic CM (2012) An improved ant-based algorithm for the degree-constrained minimum spanning tree problem. IEEE Trans Evol Comput 16(2):266\u2013278","journal-title":"IEEE Trans Evol Comput"},{"key":"851_CR28","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/IWVDVT.2005.1504567","volume-title":"Proceedings of IEEE international workshop on VLSI design and video technology","author":"L-X Han","year":"2005","unstructured":"Han L-X, Wang Y, Guo F-Y (2005) A new genetic algorithm for the degree-constrained minimum spanning tree problem. In: Proceedings of IEEE international workshop on VLSI design and video technology, pp 125\u2013128"},{"issue":"2","key":"851_CR29","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/4235.850653","volume":"4","author":"J Knowles","year":"2000","unstructured":"Knowles J, Corne D (2000) A new evolutionary approach to the degree-constrained minimum spanning tree problem. IEEE Trans Evol Comput 4(2):125\u2013134","journal-title":"IEEE Trans Evol Comput"},{"key":"851_CR30","first-page":"1793","volume-title":"Proceedings of international conference on machine learning and cybernetics","author":"W-Z Guo","year":"2009","unstructured":"Guo W-Z, Gao H-L, Chen G-L, Yu L (2009) Particle swarm optimization for the degree-constrained MST problem in WSN topology control. In: Proceedings of international conference on machine learning and cybernetics, pp 1793\u20131798"},{"key":"851_CR31","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24:1097\u20131100","journal-title":"Comput Oper Res"},{"key":"851_CR32","volume-title":"Proceedings of genetic and evolutionary computational conference (GECCO\u20192006)","author":"M Gruber","year":"2006","unstructured":"Gruber M, Hemert J, Raidl GR (2006) Neighborhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA and ACO. In: Proceedings of genetic and evolutionary computational conference (GECCO\u20192006)"},{"key":"851_CR33","doi-asserted-by":"crossref","first-page":"4354","DOI":"10.1016\/j.ins.2007.02.023","volume":"177","author":"T Oncan","year":"2007","unstructured":"Oncan T (2007) Design of capacitated minimum spanning tree with uncertain cost and demand parameters. Inf Sci 177:4354\u20134367","journal-title":"Inf Sci"},{"issue":"2","key":"851_CR34","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/j.ejor.2007.08.021","volume":"191","author":"T Oncan","year":"2008","unstructured":"Oncan T, Cordeau JF, Laporte G (2008) A tabu search heuristic for the generalized minimum spanning tree problem. Eur J Oper Res 191(2):306\u2013319","journal-title":"Eur J Oper Res"},{"issue":"4","key":"851_CR35","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1109\/90.720901","volume":"6","author":"M Parsa","year":"1998","unstructured":"Parsa M, Zhu Q, Garcia-Luna-Aceves JJ (1998) An iterative algorithm for delay-constrained minimum-cost multicasting. IEEE\/ACM Trans Netw 6(4):461\u2013474","journal-title":"IEEE\/ACM Trans Netw"},{"key":"851_CR36","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1109\/ISCC.1997.616089","volume-title":"Proceedings of the second IEEE symposium on computers and communications","author":"HF Salama","year":"1997","unstructured":"Salama HF, Reeves DS, Viniotis Y (1997) The delay-constrained minimum spanning tree problem. In: Proceedings of the second IEEE symposium on computers and communications, pp 699\u2013703"},{"key":"851_CR37","doi-asserted-by":"crossref","unstructured":"Gouveia L, Simonetti L, Uchoa E (2009) Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs. J Math Program","DOI":"10.1007\/s10107-009-0297-2"},{"key":"851_CR38","first-page":"748","volume-title":"Proceedings of American Mathematical Society","author":"JB Kruskal","year":"1956","unstructured":"Kruskal JB (1956) On the shortest spanning sub tree of a graph and the traveling salesman problem. In: Proceedings of American Mathematical Society, pp 748\u2013750"},{"key":"851_CR39","doi-asserted-by":"crossref","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 Syst Tech J 36:1389\u20131401","journal-title":"Bell Syst Tech J"},{"key":"851_CR40","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Complexity of computer computations. Plenum, New York, pp 85\u2013103"},{"key":"851_CR41","volume-title":"Learning automata: an introduction","author":"KS Narendra","year":"1989","unstructured":"Narendra KS, Thathachar KS (1989) Learning automata: an introduction. Prentice-Hall, New York"},{"key":"851_CR42","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1109\/TSMC.1987.6499323","volume":"17","author":"MAL Thathachar","year":"1987","unstructured":"Thathachar MAL, Harita BR (1987) Learning automata with changing number of actions. IEEE Trans Syst Man Cybern 17:1095\u20131100","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"851_CR43","doi-asserted-by":"crossref","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:239\u2013249","journal-title":"Comput Oper Res"},{"key":"851_CR44","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/0305-0548(85)90032-2","volume":"12","author":"M Savelsbergh","year":"1985","unstructured":"Savelsbergh M, Volgenant T (1985) Edge exchanges in the degree-constrained minimum spanning tree problem. Comput Oper Res 12:341\u2013348","journal-title":"Comput Oper Res"},{"key":"851_CR45","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1007\/978-3-540-24854-5_70","volume-title":"Genetic evolutionary computation","author":"A Delbem","year":"2004","unstructured":"Delbem A, de Carvalho A, Policastro C, Pinto A, Honda K, Garcia A (2004) Node-depth encoding for evolutionary algorithms applied to network design. In: Genetic evolutionary computation. Lecture notes in computer science, vol 3102. Springer, Berlin, pp 678\u2013687"},{"key":"851_CR46","doi-asserted-by":"crossref","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:369\u2013382","journal-title":"Parallel Comput"},{"issue":"2","key":"851_CR47","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<91::AID-NET3>3.0.CO;2-F","volume":"30","author":"G Zhou","year":"1998","unstructured":"Zhou G, Gen M (1998) A note on genetic algorithms for degree constrained spanning tree problems. Networks 30(2):91\u201395","journal-title":"Networks"},{"key":"851_CR48","unstructured":"Akbari Torkestani J (2012) A new distributed job scheduling algorithm for grid systems. Cybern Syst (to appear)"},{"issue":"1","key":"851_CR49","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1016\/j.dss.2012.08.005","volume":"54","author":"J Akbari Torkestani","year":"2012","unstructured":"Akbari Torkestani J (2012) An adaptive learning to rank algorithm: learning automata approach. Decis Support Syst 54(1):574\u2013583","journal-title":"Decis Support Syst"},{"issue":"6","key":"851_CR50","doi-asserted-by":"crossref","first-page":"2028","DOI":"10.1016\/j.jnca.2012.08.001","volume":"35","author":"J Akbari Torkestani","year":"2012","unstructured":"Akbari Torkestani J (2012) A distributed resource discovery algorithm for P2P grids. J Netw Comput Appl 35(6):2028\u20132036","journal-title":"J Netw Comput Appl"},{"key":"851_CR51","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.sna.2012.06.032","volume":"185","author":"J Akbari Torkestani","year":"2012","unstructured":"Akbari Torkestani J (2012) Backbone formation in wireless sensor networks. Sens Actuators A, Phys 185:117\u2013126","journal-title":"Sens Actuators A, Phys"},{"issue":"11","key":"851_CR52","doi-asserted-by":"crossref","first-page":"1977","DOI":"10.1007\/s00500-012-0869-6","volume":"16","author":"J Akbari Torkestani","year":"2012","unstructured":"Akbari Torkestani J (2012) An adaptive heuristic to the bounded diameter minimum spanning tree problem. Soft Comput 16(11):1977\u20131988","journal-title":"Soft Comput"},{"issue":"4","key":"851_CR53","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1007\/s10489-012-0351-2","volume":"37","author":"J Akbari Torkestani","year":"2012","unstructured":"Akbari Torkestani J (2012) An adaptive focused web crawling algorithm based on learning automata. Appl Intell 37(4):586\u2013601","journal-title":"Appl Intell"},{"key":"851_CR54","doi-asserted-by":"crossref","unstructured":"J Akbari Torkestani (2012) LAAP: a learning automata-based adaptive polling scheme for clustered wireless ad-hoc networks. Wirel Pers Commun (to appear)","DOI":"10.1007\/s11277-012-0615-5"},{"issue":"5","key":"851_CR55","doi-asserted-by":"crossref","first-page":"1633","DOI":"10.1016\/j.jnca.2012.03.008","volume":"35","author":"J Akbari Torkestani","year":"2012","unstructured":"Akbari Torkestani J (2012) Mobility prediction in mobile wireless networks. J Netw Comput Appl 35(5):1633\u20131645","journal-title":"J Netw Comput Appl"},{"key":"851_CR56","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ins.2012.02.057","volume":"200","author":"J Akbari Torkestani","year":"2012","unstructured":"Akbari Torkestani J, Meybodi MR (2012) Finding minimum weight connected dominating set in stochastic graph based on learning automata. Inf Sci 200:57\u201377","journal-title":"Inf Sci"},{"key":"851_CR57","doi-asserted-by":"crossref","unstructured":"Akbari Torkestani J (2012) A learning automata-based solution to the bounded diameter minimum spanning tree problem. J Chin Inst Eng (to appear)","DOI":"10.1007\/s00500-012-0869-6"},{"issue":"2","key":"851_CR58","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/s10844-012-0197-4","volume":"39","author":"J Akbari Torkestani","year":"2012","unstructured":"Akbari Torkestani J (2012) An adaptive learning automata-based ranking function discovery algorithm. J Intell Inf Syst 39(2):441\u2013459","journal-title":"J Intell Inf Syst"},{"issue":"3","key":"851_CR59","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s10586-011-0192-5","volume":"15","author":"J Akbari Torkestani","year":"2012","unstructured":"Akbari Torkestani J (2012) A new approach to the job scheduling problem in computational grids. Clust Comput 15(3):201\u2013210","journal-title":"Clust Comput"},{"key":"851_CR60","doi-asserted-by":"crossref","unstructured":"Akbari Torkestani J (2012) Mobility-based backbone formation in wireless mobile ad-hoc networks. Wirel Pers Commun (to appear)","DOI":"10.1007\/s11277-012-0955-1"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-012-0851-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-012-0851-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-012-0851-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,8]],"date-time":"2019-07-08T02:45:19Z","timestamp":1562553919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-012-0851-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,9]]},"references-count":60,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["851"],"URL":"https:\/\/doi.org\/10.1007\/s11227-012-0851-1","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,9]]}}}