{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T01:13:20Z","timestamp":1776820400821,"version":"3.51.2"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,5,9]],"date-time":"2012-05-09T00:00:00Z","timestamp":1336521600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Comput Vis"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s11263-012-0531-x","type":"journal-article","created":{"date-parts":[[2012,5,8]],"date-time":"2012-05-08T16:28:16Z","timestamp":1336494496000},"page":"38-58","source":"Crossref","is-referenced-by-count":29,"title":["Minimizing Energies with Hierarchical Costs"],"prefix":"10.1007","volume":"100","author":[{"given":"Andrew","family":"Delong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lena","family":"Gorelick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olga","family":"Veksler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri","family":"Boykov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,5,9]]},"reference":[{"issue":"2","key":"531_CR1","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1287\/opre.45.2.226","volume":"45","author":"C. C. Aggarwal","year":"1997","unstructured":"Aggarwal, C. C., Orlin, J. B., & Tai, R. P. (1997). Optimized crossover for the independent set problem. Operations Research, 45(2), 226\u2013234.","journal-title":"Operations Research"},{"issue":"1\u20133","key":"531_CR2","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"R. K. Ahuja","year":"2002","unstructured":"Ahuja, R. K., Ergun, \u00d6., Orlin, J. B., & Punnen, A. P. (2002). A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics, 123(1\u20133), 75\u2013202.","journal-title":"Discrete Applied Mathematics"},{"key":"531_CR3","volume-title":"IEEE conference on computer vision and pattern recognition (CVPR)","author":"O. Barinova","year":"2010","unstructured":"Barinova, O., Lempitsky, V., & Kohli, P. (2010). On the detection of multiple object instances using Hough transforms. In IEEE conference on computer vision and pattern recognition (CVPR), June 2010."},{"key":"531_CR4","volume-title":"ACM symposium on theory of computing (STOC)","author":"Y. Bartal","year":"1998","unstructured":"Bartal, Y. (1998). On approximating arbitrary metrics by tree metrics. In ACM symposium on theory of computing (STOC)."},{"key":"531_CR5","volume-title":"International conference on computer vision (ICCV)","author":"S. Birchfield","year":"1999","unstructured":"Birchfield, S., & Tomasi, C. (1999). Multiway cut for stereo and motion with slanted surfaces. In International conference on computer vision (ICCV)."},{"issue":"1\u20133","key":"531_CR6","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0166-218X(01)00341-9","volume":"123","author":"E. Boros","year":"2002","unstructured":"Boros, E., & Hammer, P. L. (2002). Pseudo-boolean optimization. Discrete Applied Mathematics, 123(1\u20133), 155\u2013225.","journal-title":"Discrete Applied Mathematics"},{"key":"531_CR7","volume-title":"International conference on computer vision (ICCV)","author":"Y. Boykov","year":"2001","unstructured":"Boykov, Y., & Jolly, M.-P. (2001). Interactive graph cuts for optimal boundary and region segmentation of objects in N-D images. In International conference on computer vision (ICCV)."},{"issue":"9","key":"531_CR8","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.1109\/TPAMI.2004.60","volume":"29","author":"Y. Boykov","year":"2004","unstructured":"Boykov, Y., & Kolmogorov, V. (2004). An experimental comparison of min-cut\/max-flow algorithms for energy minimization in vision. IEEE Transactions on Pattern Recognition and Machine Intelligence, 29(9), 1124\u20131137.","journal-title":"IEEE Transactions on Pattern Recognition and Machine Intelligence"},{"key":"531_CR9","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/0-387-28831-7_5","volume-title":"Handbook of mathematical models in computer vision","author":"Y. Boykov","year":"2006","unstructured":"Boykov, Y., & Veksler, O. (2006). Graph cuts in vision and graphics: theories and applications. In N. Paragios, Y. Chen, & O. Faugeras (Eds.), Handbook of mathematical models in computer vision (pp.\u00a079\u201396). New York: Springer."},{"issue":"11","key":"531_CR10","doi-asserted-by":"crossref","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y. Boykov","year":"2001","unstructured":"Boykov, Y., Veksler, O., & Zabih, R. (2001). Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Recognition and Machine Intelligence, 23(11), 1222\u20131239.","journal-title":"IEEE Transactions on Pattern Recognition and Machine Intelligence"},{"key":"531_CR11","volume-title":"IEEE conference on computer vision and pattern recognition (CVPR)","author":"M. J. Choi","year":"2010","unstructured":"Choi, M. J., Lim, J. J., Torralba, A., & Willsky, A. S. (2010). Exploiting hierarchical context on a large database of object categories. In IEEE conference on computer vision and pattern recognition (CVPR), June 2010."},{"key":"531_CR12","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-48777-8_9","volume-title":"LNCS, Vol.\u00a01610: Integer programming and combinatorial optimization","author":"W. Cunningham","year":"1999","unstructured":"Cunningham, W., & Tang, L. (1999). Optimal 3-terminal cuts and linear programming. In LNCS, Vol.\u00a01610: Integer programming and combinatorial optimization (pp. 114\u2013125)."},{"key":"531_CR13","unstructured":"Delong, A. (2011). Advances in graph-cut optimization. PhD thesis, University of Western Ontario."},{"key":"531_CR14","volume-title":"Energy minimization methods in computer vision and pattern recognition (EMMCVPR)","author":"A. Delong","year":"2011","unstructured":"Delong, A., Gorelick, L., Schmidt, F. R., Veksler, O., & Boykov, Y. (2011). Interactive segmentation with super-labels. In Energy minimization methods in computer vision and pattern recognition (EMMCVPR), July 2011."},{"issue":"1","key":"531_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11263-011-0437-z","volume":"96","author":"A. Delong","year":"2012","unstructured":"Delong, A., Osokin, A., Isack, H. N., & Boykov, Y. (2012). Fast approximate energy minimization with label costs. International Journal of Computer Vision, 96(1), 1\u201327 (Earlier version in CVPR 2010).","journal-title":"International Journal of Computer Vision"},{"issue":"4","key":"531_CR16","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U. (1998). A threshold of lnn for approximating set cover. Journal of the ACM, 45(4), 634\u2013652.","journal-title":"Journal of the ACM"},{"key":"531_CR17","volume-title":"IEEE conference on computer vision and pattern recognition (CVPR)","author":"P. F. Felzenszwalb","year":"2010","unstructured":"Felzenszwalb, P. F., Pap, G., Tardos, \u00c9., & Zabih, R. (2010). Globally optimal pixel labeling algorithms for tree metrics. In IEEE conference on computer vision and pattern recognition (CVPR)."},{"issue":"6","key":"531_CR18","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1145\/358669.358692","volume":"24","author":"M. A. Fischler","year":"1981","unstructured":"Fischler, M. A., & Bolles, R. C. (1981). Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Communications of the ACM, 24(6), 381\u2013395.","journal-title":"Communications of the ACM"},{"key":"531_CR19","volume-title":"Uncertainty in artificial intelligence (UAI)","author":"I. E. Givoni","year":"2011","unstructured":"Givoni, I. E., Chung, C., & Frey, B. J. (2011). Hierarchical affinity propagation. In Uncertainty in artificial intelligence (UAI), July 2011."},{"issue":"4","key":"531_CR20","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A. V. Goldberg","year":"1988","unstructured":"Goldberg, A. V., & Tarjan, R. E. (1988). A new approach to the maximum-flow problem. Journal of the Association for Computing Machinery, 35(4), 921\u2013940.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"531_CR21","volume-title":"International conference on computer vision (ICCV)","author":"L. Gorelick","year":"2011","unstructured":"Gorelick, L., Delong, A., Veksler, O., & Boykov, Y. (2011). Recursive MDL via graph cuts: application to segmentation. In International conference on computer vision (ICCV), November 2011."},{"issue":"2","key":"531_CR22","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1111\/j.2517-6161.1989.tb01764.x","volume":"51","author":"D. Greig","year":"1989","unstructured":"Greig, D., Porteous, B., & Seheult, A. (1989). Exact maximum a posteriori estimation for binary images. Journal of the Royal Statistical Society B, 51(2), 271\u2013279.","journal-title":"Journal of the Royal Statistical Society B"},{"key":"531_CR23","volume-title":"Multiple view geometry in computer vision","author":"R. Hartley","year":"2003","unstructured":"Hartley, R., & Zisserman, A. (2003). Multiple view geometry in computer vision. Cambridge: Cambridge University Press."},{"issue":"1","key":"531_CR24","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/BF01581035","volume":"22","author":"D. S. Hochbaum","year":"1982","unstructured":"Hochbaum, D. S. (1982). Heuristics for the fixed cost median problem. Mathematical Programming, 22(1), 148\u2013162.","journal-title":"Mathematical Programming"},{"issue":"2","key":"531_CR25","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s11263-011-0474-7","volume":"97","author":"H. N. Isack","year":"2012","unstructured":"Isack, H. N., & Boykov, Y. (2012). Energy-based geometric multi-model fitting. International Journal on Computer Vision, 97(2), 123\u2013147.","journal-title":"International Journal on Computer Vision"},{"key":"531_CR26","volume-title":"ACM SIGGRAPH","author":"E. Kalogerakis","year":"2010","unstructured":"Kalogerakis, E., Hertzmann, A., & Singh, K. (2010). Learning 3D mesh segmentation and labeling. In ACM SIGGRAPH."},{"issue":"3","key":"531_CR27","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/j.jda.2008.11.006","volume":"7","author":"E. Kantor","year":"2009","unstructured":"Kantor, E., & Peleg, D. (2009). Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems. Journal of Discrete Algorithms, 7(3), 341\u2013362.","journal-title":"Journal of Discrete Algorithms"},{"key":"531_CR28","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/585265.585268","volume":"49","author":"J. Kleinberg","year":"2002","unstructured":"Kleinberg, J., & Tardos, \u00c9. (2002). Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields. Journal of the ACM, 49, 5.","journal-title":"Journal of the ACM"},{"issue":"10","key":"531_CR29","doi-asserted-by":"crossref","first-page":"1568","DOI":"10.1109\/TPAMI.2006.200","volume":"28","author":"V. Kolmogorov","year":"2006","unstructured":"Kolmogorov, V. (2006). Convergent tree-reweighted message passing for energy minimization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(10), 1568\u20131583.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"7","key":"531_CR30","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1109\/TPAMI.2007.1031","volume":"29","author":"V. Kolmogorov","year":"2007","unstructured":"Kolmogorov, V., & Rother, C. (2007). Minimizing non-submodular functions with graph cuts\u2014a review. IEEE Transactions on Pattern Recognition and Machine Intelligence (TPAMI), 29(7), 1274\u20131279","journal-title":"IEEE Transactions on Pattern Recognition and Machine Intelligence (TPAMI)"},{"issue":"2","key":"531_CR31","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/TPAMI.2004.1262177","volume":"26","author":"V. Kolmogorov","year":"2004","unstructured":"Kolmogorov, V., & Zabih, R. (2004). What energy functions can be optimized via graph cuts. IEEE Transactions on Pattern Recognition and Machine Intelligence, 26(2), 147\u2013159.","journal-title":"IEEE Transactions on Pattern Recognition and Machine Intelligence"},{"key":"531_CR32","first-page":"313","volume-title":"Conference on uncertainty in artificial intelligence","author":"M. P. Kumar","year":"2009","unstructured":"Kumar, M. P., & Koller, D. (2009). MAP estimation of semi-metric MRFs via hierarchical graph cuts. In Conference on uncertainty in artificial intelligence (pp. 313\u2013320), June 2009."},{"key":"531_CR33","volume-title":"European conference on computer vision (ECCV)","author":"L. Ladick\u00fd","year":"2010","unstructured":"Ladick\u00fd, L., Russell, C., Kohli, P., & Torr, P. H. S. (2010a). Graph cut based inference with co-occurrence statistics. In European conference on computer vision (ECCV), September 2010."},{"key":"531_CR34","volume-title":"British machine vision conference (BMVC)","author":"L. Ladick\u00fd","year":"2010","unstructured":"Ladick\u00fd, L., Sturgess, P., Russell, C., Sengupta, S., Bastanlar, Y., Clocksin, W., & Torr, P. H. S. (2010b) Joint optimisation for object class segmentation and dense stereo reconstruction. In British machine vision conference (BMVC)."},{"key":"531_CR35","volume-title":"International conference on computer vision (ICCV)","author":"N. Lazic","year":"2009","unstructured":"Lazic, N., Givoni, I., Frey, B. J., & Aarabi, P. (2009). FLoSS: facility location for subspace segmentation. In International conference on computer vision (ICCV)."},{"key":"531_CR36","doi-asserted-by":"crossref","first-page":"1392","DOI":"10.1109\/TPAMI.2009.143","volume":"32","author":"V. Lempitsky","year":"2010","unstructured":"Lempitsky, V., Rother, C., Roth, S., & Blake, A. (2010). Fusion moves for Markov random field optimization. IEEE Transactions on Pattern Analysis and Machine Inference, 32, 1392\u20131405.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Inference"},{"key":"531_CR37","volume-title":"Markov random field modeling in image analysis","author":"S. Z. Li","year":"1994","unstructured":"Li, S. Z. (1994). Markov random field modeling in image analysis. Berlin: Springer."},{"key":"531_CR38","volume-title":"IEEE conference on computer vision and pattern recognition (CVPR)","author":"H. Li","year":"2007","unstructured":"Li, H. (2007). Two-view motion segmentation from linear programming relaxation. In IEEE conference on computer vision and pattern recognition (CVPR)."},{"key":"531_CR39","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/978-3-540-77345-0_2","volume-title":"Practice and theory of automated timetabling","author":"C. Meyers","year":"2007","unstructured":"Meyers, C., & Orlin, J. B. (2007). Very large-scale neighborhood search techniques in timetabling problems. In Practice and theory of automated timetabling (Vol.\u00a0VI, p. 24)."},{"key":"531_CR40","volume-title":"International conference on computer vision","author":"C. Olsson","year":"2009","unstructured":"Olsson, C., Byr\u00f6d, M., Overgaard, N. C., & Kahl, F. (2009). Extending continuous cuts: anisotropic metrics and expansion moves. In International conference on computer vision, October 2009."},{"key":"531_CR41","volume-title":"European conference on computer vision (ECCV)","author":"T. Pock","year":"2008","unstructured":"Pock, T., Schoenemann, T., Graber, G., Bischof, H., & Cremers, D. (2008). A convex formulation of continuous multi-label problems. In European conference on computer vision (ECCV), October 2008."},{"key":"531_CR42","volume-title":"IEEE conference on computer vision and pattern recognition (CVPR)","author":"T. Pock","year":"2009","unstructured":"Pock, T., Chambolle, A., Bischof, H., & Cremers, D. (2009). A convex relaxation approach for computing minimal partitions. In IEEE conference on computer vision and pattern recognition (CVPR), June 2009."},{"key":"531_CR43","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1017\/S0305004100027419","volume":"48","author":"R. B. Potts","year":"1952","unstructured":"Potts, R. B. (1952). Some generalized order-disorder transformations. Mathematical Proceedings of the Cambridge Philosophical Society, 48, 106\u2013109.","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"531_CR44","volume-title":"IEEE conference on computer vision and pattern recognition (CVPR)","author":"C. Rother","year":"2005","unstructured":"Rother, C., Kumar, S., Kolmogorov, V., & Blake, A. (2005). Digital tapestry. In IEEE conference on computer vision and pattern recognition (CVPR)."},{"key":"531_CR45","volume-title":"IEEE conference on computer vision and pattern recognition (CVPR)","author":"C. Rother","year":"2007","unstructured":"Rother, C., Kolmogorov, V., Lempitsky, V., & Szummer, M. (2007). Optimizing binary MRFs via extended roof duality. In IEEE conference on computer vision and pattern recognition (CVPR), June 2007."},{"issue":"8","key":"531_CR46","doi-asserted-by":"crossref","first-page":"2310","DOI":"10.1016\/j.cor.2005.09.005","volume":"34","author":"G. Sahin","year":"2007","unstructured":"Sahin, G., & S\u00fcral, H. (2007). A review of hierarchical facility location models. Computers and Operations Research, 34(8), 2310\u20132331.","journal-title":"Computers and Operations Research"},{"key":"531_CR47","volume-title":"Research in computational molecular biology","author":"E. Sefer","year":"2011","unstructured":"Sefer, E., & Kingsford, C. (2011). Metric labeling and semi-metric embedding for protein annotation prediction. In Research in computational molecular biology."},{"key":"531_CR48","first-page":"265","volume-title":"ACM symposium on theory of computing (STOC)","author":"D. B. Shmoys","year":"1998","unstructured":"Shmoys, D. B., Tardos, \u00c9., & Aardal, K. (1998). Approximation algorithms for facility location problems. In ACM symposium on theory of computing (STOC) (pp.\u00a0265\u2013274)."},{"key":"531_CR49","volume-title":"IEEE conference on computer vision and pattern recognition (CVPR)","author":"P. Strandmark","year":"2010","unstructured":"Strandmark, P., & Kahl, F. (2010). Parallel and distributed graph cuts by dual decomposition. In IEEE conference on computer vision and pattern recognition (CVPR), June 2010."},{"key":"531_CR50","volume-title":"ACM-SIAM symposium on discrete algorithms (SODA)","author":"Z. Svitkina","year":"2006","unstructured":"Svitkina, Z., & Tardos, \u00c9. (2006). Facility location with hierarchical facility costs. In ACM-SIAM symposium on discrete algorithms (SODA)."},{"key":"531_CR51","first-page":"16","volume-title":"European conference on computer vision (ECCV)","author":"R. Szeliski","year":"2006","unstructured":"Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., & Rother, C. (2006). A comparative study of energy minimization methods for Markov random fields. In European conference on computer vision (ECCV) (pp.\u00a016\u201329)."},{"key":"531_CR52","first-page":"1321","volume-title":"Philosophical transactions of the royal society A","author":"P. H. S. Torr","year":"1998","unstructured":"Torr, P. H. S. (1998). Geometric motion segmentation and model selection. In Philosophical transactions of the royal society A (pp.\u00a01321\u20131340)."},{"key":"531_CR53","volume-title":"European conference on computer vision (ECCV)","author":"P. H. S. Torr","year":"1994","unstructured":"Torr, P. H. S., & Murray, D. (1994). Stochastic motion clustering. In European conference on computer vision (ECCV)."},{"key":"531_CR54","unstructured":"Veksler, O. (1999). Efficient graph-based energy minimization methods in computer vision. PhD thesis, Cornell University."},{"key":"531_CR55","volume-title":"IEEE conference on computer vision and pattern recognition (CVPR)","author":"T. Werner","year":"2008","unstructured":"Werner, T. (2008). High-arity interactions, polyhedral relaxations, and cutting plane algorithm for soft constraint optimisation (MAP-MRF). In IEEE conference on computer vision and pattern recognition (CVPR), June 2008."},{"key":"531_CR56","volume-title":"International conference on computer vision (ICCV)","author":"O. J. Woodford","year":"2009","unstructured":"Woodford, O. J., Rother, C., & Kolmogorov, V. (2009). A global perspective on map inference for low-level vision. In International conference on computer vision (ICCV), October 2009."},{"key":"531_CR57","volume-title":"British machine vision conference (BMVC)","author":"J. Yuan","year":"2010","unstructured":"Yuan, J., & Boykov, Y. (2010). TV-based multi-label image segmentation with label cost prior. In British machine vision conference (BMVC), September 2010."},{"key":"531_CR58","unstructured":"Zhou, Q., Wu, T., Liu, W., & Zhu, S.-C. (2011). Scene parsing by data-driven cluster sampling. International Journal of Computer Vision."},{"issue":"9","key":"531_CR59","doi-asserted-by":"crossref","first-page":"884","DOI":"10.1109\/34.537343","volume":"18","author":"S.-C. Zhu","year":"1996","unstructured":"Zhu, S.-C., & Yuille, A. L. (1996). Region competition: unifying snakes, region growing, and Bayes\/MDL for multiband image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(9), 884\u2013900.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"}],"container-title":["International Journal of Computer Vision"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11263-012-0531-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11263-012-0531-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11263-012-0531-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T10:06:40Z","timestamp":1713953200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11263-012-0531-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,9]]},"references-count":59,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["531"],"URL":"https:\/\/doi.org\/10.1007\/s11263-012-0531-x","relation":{},"ISSN":["0920-5691","1573-1405"],"issn-type":[{"value":"0920-5691","type":"print"},{"value":"1573-1405","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,9]]}}}