{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T13:48:38Z","timestamp":1744897718227,"version":"3.37.3"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,11,11]],"date-time":"2016-11-11T00:00:00Z","timestamp":1478822400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/K007645\/1"],"award-info":[{"award-number":["EP\/K007645\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Natural Science Foundation of China (CN)","award":["11301515"],"award-info":[{"award-number":["11301515"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10107-016-1090-7","type":"journal-article","created":{"date-parts":[[2016,11,11]],"date-time":"2016-11-11T16:17:43Z","timestamp":1478881063000},"page":"341-381","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction"],"prefix":"10.1007","volume":"164","author":[{"given":"Chao","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hou-Duo","family":"Qi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,11]]},"reference":[{"key":"1090_CR1","doi-asserted-by":"crossref","unstructured":"Adamic, A.A., Glance, N.: The political blogosphere and the 2004 US election: divided they blog. In: Proceedings of the 3rd International Workshop on Link Discovery (2005)","DOI":"10.1145\/1134271.1134277"},{"key":"1090_CR2","first-page":"1747","volume":"14","author":"E Arias-Castro","year":"2013","unstructured":"Arias-Castro, E., Pelletier, B.: On the convergence of maximum variance unfolding. J. Mach. Learn. Res. 14, 1747\u20131770 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"1090_CR3","doi-asserted-by":"crossref","unstructured":"Bai, S.H., Qi, H.-D.: Tackling the flip ambiguity in wireless sensor network localization and beyond. http:\/\/www.personal.soton.ac.uk\/hdqi\/REPORTS\/EDMSNL (2015)","DOI":"10.1016\/j.dsp.2016.05.006"},{"key":"1090_CR4","unstructured":"Bernstein, M., De Silva, V., Langford, J.C., Tenenbaum, J.B.: Graph approximations to geodesics on embedded manifolds. http:\/\/isomap.stanford.edu\/BdSLT , Stanford University (2000)"},{"key":"1090_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0653-8","volume-title":"Matrix Analysis","author":"R Bhatia","year":"1997","unstructured":"Bhatia, R.: Matrix Analysis. Springer, New York (1997)"},{"key":"1090_CR6","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1109\/TASE.2006.877401","volume":"3","author":"P Biswas","year":"2006","unstructured":"Biswas, P., Liang, T.-C., Toh, K.-C., Ye, Y., Wang, T.C.: Semidefinite programming approaches for sensor network localization with noisy distance measurements. IEEE Trans. Autom. Sci. Eng. 3, 360\u2013371 (2006)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"1090_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs. Cambridge University Press, Cambridge (2001)"},{"key":"1090_CR8","volume-title":"Modern Multidimensional Scaling","author":"I Borg","year":"2005","unstructured":"Borg, I., Groenen, P.J.F.: Modern Multidimensional Scaling. Springer, Berlin (2005)"},{"key":"1090_CR9","first-page":"400","volume":"95","author":"V Brian","year":"2006","unstructured":"Brian, V.: Connecting the dots. Am Sci 95, 400\u2013404 (2006)","journal-title":"Am Sci"},{"key":"1090_CR10","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/s13278-013-0101-4","volume":"3","author":"M Budka","year":"2013","unstructured":"Budka, M., Juszczyszyn, K., Musial, K., Musial, A.: Molecular model of dynamic social network based on e-mail communication. Soc. Netw. Anal. Min. 3, 543\u2013563 (2013)","journal-title":"Soc. Netw. Anal. Min."},{"key":"1090_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-20192-9","volume-title":"Statistics for High-Dimensional Data: Methods, Theory and Applications","author":"P B\u00fchlmann","year":"2011","unstructured":"B\u00fchlmann, P., Van De Geer, S.: Statistics for High-Dimensional Data: Methods, Theory and Applications. Springer, Berlin (2011)"},{"key":"1090_CR12","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1561\/2200000002","volume":"2","author":"CJC Burges","year":"2009","unstructured":"Burges, C.J.C.: Dimension reduction: a guided tour. Found. Trend Mach. Learn. 2, 275\u2013365 (2009)","journal-title":"Found. Trend Mach. Learn."},{"key":"1090_CR13","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1109\/JPROC.2009.2035722","volume":"98","author":"EJ Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E.J., Plan, Y.: Matrix completion with noise. Proc. IEEE 98, 925\u2013936 (2010)","journal-title":"Proc. IEEE"},{"key":"1090_CR14","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9, 717\u2013772 (2008)","journal-title":"Found. Comput. Math."},{"key":"1090_CR15","doi-asserted-by":"crossref","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"EJ Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E.J., Tao, T.: The power of convex relaxation: near-optimal matrix completion. IEEE Trans. Inf. Theory 56, 2053\u20132080 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1090_CR16","unstructured":"Chen, W., Chen, Y., Weinberger, K.Q.: Maximum variance correction with application to A* search. In: Proceedings of the 30th International Conference Machine Learning (ICML-13), pp. 302\u2013310 (2013)"},{"key":"1090_CR17","unstructured":"Cohen, W.W., William, W.: Enron email dataset (2009)"},{"key":"1090_CR18","volume-title":"Multidimensional Scaling","author":"TF Cox","year":"2001","unstructured":"Cox, T.F., Cox, M.A.A.: Multidimensional Scaling, 2nd edn. Chapman and Hall\/CRC, Boca Raton (2001)","edition":"2"},{"key":"1090_CR19","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0378-8733(78)90011-4","volume":"1","author":"I Sola Pool de","year":"1979","unstructured":"de Sola Pool, I., Kochen, M.: Contacts and influence. Soc. Netw. 1, 5\u201351 (1979)","journal-title":"Soc. Netw."},{"key":"1090_CR20","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs. Publicationes Mathematicae Debrecen 6, 290\u2013297 (1959)","journal-title":"Publicationes Mathematicae Debrecen"},{"key":"1090_CR21","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1073\/pnas.35.11.652","volume":"35","author":"K Fan","year":"1949","unstructured":"Fan, K.: On a theorem of Weyl concerning eigenvalues of linear transformations I. Proc. Nat. Acad. Sci. 35, 652\u2013655 (1949)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"1090_CR22","unstructured":"Fazel, M.: Matrix Rank Minimization with Applications. Ph.D. Thesis, Stanford University (2002)"},{"key":"1090_CR23","doi-asserted-by":"crossref","unstructured":"Freeman, L.C.: Graphic techniques for exploring social network data. In: Carrington, Peter J., Scott, J., Wasserman, s.(eds) Models and Methods in Social Network Analysis, vol.28 Cambridge University Press, Cambridge. p. 248\u2013269 (2005)","DOI":"10.1017\/CBO9780511811395.012"},{"key":"1090_CR24","unstructured":"Freeman, L.C.: Freeman Datasets. http:\/\/moreno.ss.uci.edu\/data.html (2010)"},{"key":"1090_CR25","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1093\/biomet\/53.3-4.325","volume":"53","author":"JC Gower","year":"1966","unstructured":"Gower, J.C.: Some distance properties of latent root and vector methods used in multivariate analysis. Biometrika 53, 325\u2013338 (1966)","journal-title":"Biometrika"},{"key":"1090_CR26","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.1109\/TIT.2011.2104999","volume":"57","author":"D Gross","year":"2011","unstructured":"Gross, D.: Recovering low-rank matrices from few coefficients in any basis. IEEE Trans. Inf. Theory 57, 1548\u20131566 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1090_CR27","volume-title":"Random Graphs","author":"S Janson","year":"2011","unstructured":"Janson, S., Luczak, T., Rucinski, A.: Random Graphs. Wiley, Hoboken (2011)"},{"key":"1090_CR28","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s10208-012-9129-5","volume":"13","author":"A Javanmard","year":"2013","unstructured":"Javanmard, A., Montanari, A.: Localization from incomplete noisy distance measurements. Found. Comput. Math. 13, 297\u2013345 (2013)","journal-title":"Found. Comput. Math."},{"key":"1090_CR29","first-page":"2057","volume":"11","author":"RH Keshavan","year":"2010","unstructured":"Keshavan, R.H., Montanari, A., Oh, S.: Matrix completion from noisy entries. J. Mach. Learn. Res. 11, 2057\u20132078 (2010)","journal-title":"J. Mach. Learn. Res."},{"key":"1090_CR30","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1002\/asi.20274","volume":"57","author":"R Klavans","year":"2006","unstructured":"Klavans, R., Boyack, K.W.: Identifying a better measure of relatedness for mapping science. J. Am. Soc. Inf. Sci. Technol. 57, 251\u2013263 (2006)","journal-title":"J. Am. Soc. Inf. Sci. Technol."},{"key":"1090_CR31","doi-asserted-by":"crossref","first-page":"1161","DOI":"10.1214\/11-EJS637","volume":"5","author":"O Klopp","year":"2011","unstructured":"Klopp, O.: Rank penalized estimators for high-dimensional matrices. Electron. J. Stat. 5, 1161\u20131183 (2011)","journal-title":"Electron. J. Stat."},{"key":"1090_CR32","doi-asserted-by":"crossref","first-page":"282","DOI":"10.3150\/12-BEJ486","volume":"20","author":"O Klopp","year":"2014","unstructured":"Klopp, O.: Noisy low-rank matrix completion with general sampling distribution. Bernoulli 20, 282\u2013303 (2014)","journal-title":"Bernoulli"},{"key":"1090_CR33","doi-asserted-by":"crossref","unstructured":"Koltchinskii, V.: Oracle inequalities in empirical risk minimization and sparse recovery problems. In: Ecole d\u2019Et\u00e9 de Probabilit\u00e9s de Saint-Flour XXXVIII-2008, vol. 2033, Springer (2011)","DOI":"10.1007\/978-3-642-22147-7"},{"key":"1090_CR34","doi-asserted-by":"crossref","first-page":"2302","DOI":"10.1214\/11-AOS894","volume":"39","author":"V Koltchinskii","year":"2011","unstructured":"Koltchinskii, V., Lounici, K., Tsybakov, A.B.: Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion. Ann. Stat. 39, 2302\u20132329 (2011)","journal-title":"Ann. Stat."},{"key":"1090_CR35","unstructured":"LeCun, Y., Cortes, C., Burges, C.J.C.: MNIST. http:\/\/yann.lecun.com\/exdb\/mnist\/ (1998)"},{"key":"1090_CR36","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-20212-4","volume-title":"Probability in Banach Spaces: Isoperimetry and Processes","author":"M Ledoux","year":"1991","unstructured":"Ledoux, M., Talagrand, M.: Probability in Banach Spaces: Isoperimetry and Processes. Springer, Berlin (1991)"},{"key":"1090_CR37","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s10107-014-0850-5","volume":"155","author":"X Li","year":"2016","unstructured":"Li, X., Sun, D.F., Toh, K.-C.: A schur complement based semiproximal ADMM for convex quadratic conic programming and extensions. Math. Prog. 155, 333\u2013373 (2016)","journal-title":"Math. Prog."},{"key":"1090_CR38","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0167-6911(97)00111-4","volume":"33","author":"M Mesbahi","year":"1998","unstructured":"Mesbahi, M.: On the rank minimization problem and its control applications. Syst. Control Lett. 33, 31\u201336 (1998)","journal-title":"Syst. Control Lett."},{"key":"1090_CR39","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0961-7","author":"W Miao","year":"2016","unstructured":"Miao, W., Pan, S., Sun, D.F.: A rank-corrected procedure for matrix completion with fixed basis coefficients. Math. Prog. (2016). doi: 10.1007\/s10107-015-0961-7","journal-title":"Math. Prog."},{"key":"1090_CR40","first-page":"60","volume":"2","author":"S Milgram","year":"1967","unstructured":"Milgram, S.: The small world problem. Psychol. Today 2, 60\u201367 (1967)","journal-title":"Psychol. Today"},{"key":"1090_CR41","first-page":"1665","volume":"13","author":"S Negahban","year":"2012","unstructured":"Negahban, S., Wainwright, M.J.: Restricted strong convexity and weighted matrix completion: optimal bounds with noise. J. Mach. Learn. Res. 13, 1665\u20131697 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"1090_CR42","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"MEJ Newman","year":"2003","unstructured":"Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45, 167\u2013256 (2003)","journal-title":"SIAM Rev."},{"key":"1090_CR43","unstructured":"Opsahl, T.: US Airport 2010. http:\/\/toreopsahl.com\/datasets\/#usairports (2011)"},{"key":"1090_CR44","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.socnet.2009.02.002","volume":"31","author":"T Opsahl","year":"2009","unstructured":"Opsahl, T., Panzarasa, P.: Clustering in weighted networks. Soc. Netw. 31, 155\u2013163 (2009)","journal-title":"Soc. Netw."},{"key":"1090_CR45","unstructured":"Paprotny, A., Garcke, J.: On a connection between maximum variance unfolding, shortest path problems and isomap. In: International Conference on Artificial Intelligence and Statistics, pp. 859\u2013867 (2012)"},{"key":"1090_CR46","first-page":"175","volume":"2","author":"E P\u0229kalska","year":"2002","unstructured":"P\u0229kalska, E., Pacl\u00edk, P., Duin, P.W.: A generalized kernel approach to dissimilarity-based classification. J. Mach. Learn. Res. 2, 175\u2013211 (2002)","journal-title":"J. Mach. Learn. Res."},{"key":"1090_CR47","first-page":"3413","volume":"12","author":"B Recht","year":"2011","unstructured":"Recht, B.: A simpler approach to matrix completion. J. Mach. Learn. Res. 12, 3413\u20133430 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"1090_CR48","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52, 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"key":"1090_CR49","unstructured":"Roweis, S.T., Saul, L.K.: Frey Face. http:\/\/www.cs.nyu.edu\/~roweis\/data.html (2000)"},{"key":"1090_CR50","doi-asserted-by":"crossref","first-page":"724","DOI":"10.2307\/1968654","volume":"36","author":"IJ Schoenberg","year":"1935","unstructured":"Schoenberg, I.J.: Remarks to Maurice Fr\u00e9chet\u2019s article \u201cSur la d\u00e9finition axiomatque d\u2019une classe d\u2019espaces vectoriels distanci\u00e9s applicbles vectoriellement sur l\u2019espace de Hilbet\u201d. Ann. Math. 36, 724\u2013732 (1935)","journal-title":"Ann. Math."},{"key":"1090_CR51","unstructured":"Shaw, B., Jebara, T.: Minimum volume embedding. In: International Conference on Artificial Intelligence and Statistics, pp. 460\u2013467 (2007)"},{"key":"1090_CR52","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF02478357","volume":"13","author":"R Solomonoff","year":"1951","unstructured":"Solomonoff, R., Rapoport, A.: Connectivity of random nets. Bull. Math. Biophys. 13, 107\u2013117 (1951)","journal-title":"Bull. Math. Biophys."},{"key":"1090_CR53","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1137\/S0036144504443821","volume":"48","author":"J Sun","year":"2006","unstructured":"Sun, J., Boyd, S., Xiao, L., Diaconis, P.: The fastest mixing Markov process on a graph and a connection to a maximum variance unfolding problem. SIAM Rev. 48, 681\u2013699 (2006)","journal-title":"SIAM Rev."},{"key":"1090_CR54","doi-asserted-by":"crossref","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","volume":"290","author":"JB Tenenbaum","year":"2000","unstructured":"Tenenbaum, J.B., De Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290, 2319\u20132323 (2000)","journal-title":"Science"},{"key":"1090_CR55","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"KC Toh","year":"1999","unstructured":"Toh, K.C., Todd, M.J., T\u00fct\u00fcnc\u00fc, R.H.: SDPT3\u2014a MATLAB software package for semidefinite programming, version 1.3. Optim. Methods Softw. 11, 545\u2013581 (1999)","journal-title":"Optim. Methods Softw."},{"key":"1090_CR56","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s10208-011-9099-z","volume":"12","author":"JA Tropp","year":"2012","unstructured":"Tropp, J.A.: User-friendly tail bounds for sums of random matrices. Found. Comput. Math. 12, 389\u2013434 (2012)","journal-title":"Found. Comput. Math."},{"key":"1090_CR57","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1137\/050640308","volume":"18","author":"P Tseng","year":"2007","unstructured":"Tseng, P.: Second-order cone programming relaxation of sensor network localization. SIAM J. Optim. 18, 156\u2013185 (2007)","journal-title":"SIAM J. Optim."},{"key":"1090_CR58","volume-title":"Compressed Sensing: Theory and Applications","author":"R Vershynin","year":"2012","unstructured":"Vershynin, R.: Introduction to the non-asymptotic analysis of random matrices. In: Eldar, Y.C., Kutyniok, G. (eds.) Compressed Sensing: Theory and Applications. Cambridge University Press, Cambridge (2012)"},{"key":"1090_CR59","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis: Methods and Applications","author":"S Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)"},{"key":"1090_CR60","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0024-3795(92)90407-2","volume":"170","author":"GA Watson","year":"1992","unstructured":"Watson, G.A.: Characterization of the subdifferential of some matrix norms. Linear Alg. Appl. 170, 33\u201345 (1992)","journal-title":"Linear Alg. Appl."},{"key":"1090_CR61","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s11263-005-4939-z","volume":"70","author":"KQ Weinberger","year":"2006","unstructured":"Weinberger, K.Q., Saul, L.K.: Unsupervised learning of image manifolds by semidefinite programming. Int. J. Comput. Vis. 70, 77\u201390 (2006)","journal-title":"Int. J. Comput. Vis."},{"key":"1090_CR62","first-page":"1489","volume":"19","author":"KQ Weinberger","year":"2007","unstructured":"Weinberger, K.Q., Sha, F., Zhu, Q., Saul, L.K.: Graph Laplacian regularization for large-scale semidefinite programming. Adv. Neural Inf. Process. Syst. 19, 1489\u20131496 (2007)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"1090_CR63","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF02287916","volume":"3","author":"G Young","year":"1938","unstructured":"Young, G., Householder, A.S.: Discussion of a set of points in terms of their mutual distances. Psychometrika 3, 19\u201322 (1938)","journal-title":"Psychometrika"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-016-1090-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1090-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1090-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,20]],"date-time":"2023-08-20T21:52:21Z","timestamp":1692568341000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-016-1090-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,11]]},"references-count":63,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["1090"],"URL":"https:\/\/doi.org\/10.1007\/s10107-016-1090-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2016,11,11]]}}}