{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T17:51:22Z","timestamp":1771955482202,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2006,9,19]],"date-time":"2006-09-19T00:00:00Z","timestamp":1158624000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2007,1,30]]},"DOI":"10.1007\/s10107-006-0040-1","type":"journal-article","created":{"date-parts":[[2006,9,18]],"date-time":"2006-09-18T09:00:46Z","timestamp":1158570046000},"page":"367-384","source":"Crossref","is-referenced-by-count":227,"title":["Theory of semidefinite programming for Sensor Network Localization"],"prefix":"10.1007","volume":"109","author":[{"given":"Anthony Man-Cho","family":"So","sequence":"first","affiliation":[]},{"given":"Yinyu","family":"Ye","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,9,19]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0024-3795(00)00066-5","volume":"310","author":"A.Y. Alfakih","year":"2000","unstructured":"Alfakih A.Y. (2000): Graph rigidity via euclidean distance matrices. Linear Algebra Appl. 310, 149\u2013165","journal-title":"Linear Algebra Appl."},{"key":"40_CR2","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0024-3795(00)00281-0","volume":"325","author":"A.Y. Alfakih","year":"2001","unstructured":"Alfakih A.Y. (2001): On rigidity and realizability of weighted graphs. Linear Algebra Appl. 325, 57\u201370","journal-title":"Linear Algebra Appl."},{"key":"40_CR3","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1023\/A:1008655427845","volume":"12","author":"A.Y. Alfakih","year":"1999","unstructured":"Alfakih A.Y., Khandani A., Wolkowicz H. (1999): Solving euclidean distance matrix completion problems via semidefinite programming. Comput. Opt. Appl. 12, 13\u201330","journal-title":"Comput. Opt. Appl."},{"key":"40_CR4","unstructured":"Alfakih, A.Y., Wolkowicz, H.: On the embeddability of weighted graphs in euclidean spaces. Research Report CORR 98-12, University of Waterloo, Department of Combinatorics and Optimization (1998)"},{"key":"40_CR5","unstructured":"Alfakih, A.Y., Wolkowicz, H.: Euclidean distance matrices and the molecular conformation problem. Research Report CORR 2002-17, University of Waterloo, Department of Combinatorics and Optimization (2002)"},{"key":"40_CR6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F. Alizadeh","year":"1995","unstructured":"Alizadeh F. (1995): Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Opt. 5, 13\u201351","journal-title":"SIAM J. Opt."},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"Aspnes, J., Goldenberg, D., Yang, Y.R.: On the computational complexity of sensor network localization. ALGOSENSORS 2004, in LNCS 3121, 32\u201344 (2004)","DOI":"10.1007\/978-3-540-27820-7_5"},{"key":"40_CR8","unstructured":"B\u0103doiu, M.: Approximation algorithm for embedding metrics into a two-dimensional space. Proceedings 14th SODA, pp. 434\u2013443 (2003)"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"B\u0103doiu, M., Demaine, E.D., Hajiaghayi, M.T., Indyk, P.: Low-dimensional embedding with extra information. Proceedings 20th SoCG, pp. 320\u2013329 (2004)","DOI":"10.1145\/997817.997866"},{"key":"40_CR10","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF02574037","volume":"13","author":"A. Barvinok","year":"1995","unstructured":"Barvinok A. (1995): Problems of distance geometry and convex properties of quadratic maps. Disc. Comput. Geom. 13, 189\u2013202","journal-title":"Disc. Comput. Geom."},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"Barvinok, A.: A course in convexity. AMS (2002)","DOI":"10.1090\/gsm\/054"},{"key":"40_CR12","doi-asserted-by":"crossref","unstructured":"Biswas, P., Ye, Y.: Semidefinite programming for Ad Hoc wireless sensor network localization. Proceedings 3rd IPSN, pp. 46\u201354 (2004)","DOI":"10.1145\/984622.984630"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"Boyd, S., Ghaoui, L.E., Feron, E., Balakrishnan, V.: Linear matrix inequalities in system and control theory. SIAM (1994)","DOI":"10.1137\/1.9781611970777"},{"key":"40_CR14","doi-asserted-by":"crossref","unstructured":"Doherty, L., Ghaoui, L.E., Pister, S.J.: Convex position estimation in wireless sensor networks. Proceedings 20th INFOCOM, Vol. 3, pp. 1655\u20131663 (2001)","DOI":"10.1109\/INFCOM.2001.916662"},{"key":"40_CR15","doi-asserted-by":"crossref","unstructured":"Eren, T., Goldenberg, D.K., Whiteley, W., Yang, Y.R., Moore, A.S., Anderson, B.D.O., Belhumeur, P.N.: Rigidity, computation, and randomization in network localization. Proceedings 23rd INFOCOM (2004)","DOI":"10.1109\/INFCOM.2004.1354686"},{"issue":"4","key":"40_CR16","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1137\/S105262349630009X","volume":"8","author":"D. Goldfarb","year":"1998","unstructured":"Goldfarb D., Scheinberg K. (1998): Interior point trajectories in semidefinite programming. SIAM J. Opt. 8(4): 871\u2013886","journal-title":"SIAM J. Opt."},{"key":"40_CR17","doi-asserted-by":"crossref","unstructured":"Gower, J.C.: Some distance properties of latent root and vector methods in multivariate analysis. Biometrika 53 325\u2013338 (1966)","DOI":"10.1093\/biomet\/53.3-4.325"},{"key":"40_CR18","doi-asserted-by":"crossref","unstructured":"Graver, J., Servatius, B., Servatius, H.: Combinatorial rigidity. AMS (1993)","DOI":"10.1090\/gsm\/002"},{"key":"40_CR19","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01580610","volume":"60","author":"O. G\u00fcler","year":"1993","unstructured":"G\u00fcler O., Ye Y. (1993): Convergence behavior of interior point algorithms. Math. Prog. 60, 215\u2013228","journal-title":"Math. Prog."},{"issue":"1","key":"40_CR20","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1137\/0221008","volume":"21","author":"B. Hendrickson","year":"1992","unstructured":"Hendrickson B. (1992): Conditions for unique graph realizations. SIAM J. Comput. 21(1): 65\u201384","journal-title":"SIAM J. Comput."},{"issue":"4","key":"40_CR21","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1137\/0805040","volume":"5","author":"B. Hendrickson","year":"1995","unstructured":"Hendrickson B. (1995): The molecule problem: exploiting structure in global optimization. SIAM J. Opt. 5(4): 835\u2013857","journal-title":"SIAM J. Opt."},{"key":"40_CR22","unstructured":"Jackson, B., Jord\u00e1n, T.: Connected rigidity matroids and unique realizations of graphs. Preprint (2003)"},{"key":"40_CR23","first-page":"221","volume":"3","author":"M. Laurent","year":"2001","unstructured":"Laurent M. (2001): Matrix completion problems. The Encycl. Optim. 3, 221\u2013229","journal-title":"The Encycl. Optim."},{"issue":"2","key":"40_CR24","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01200757","volume":"15","author":"N. Linial","year":"1995","unstructured":"Linial N., London E., Rabinovich Yu. (1995): The geometry of graphs and some of its algorithmic applications. Combinatorica 15(2): 215\u2013245","journal-title":"Combinatorica"},{"key":"40_CR25","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1137\/S1052623495283024","volume":"7","author":"J. Mor\u00e9","year":"1997","unstructured":"Mor\u00e9 J., Wu Z. (1997): Global continuation for distance geometry problems. SIAM J. Opt. 7, 814\u2013836","journal-title":"SIAM J. Opt."},{"key":"40_CR26","unstructured":"Savarese, C., Rabay, J. Langendoen, K.: Robust positioning algorithms for distributed Ad-Hoc wireless sensor networks. USENIX Annual Technical Conference (2002)"},{"key":"40_CR27","doi-asserted-by":"crossref","unstructured":"Savvides, A., Han, C.-C., Srivastava, M.B.: Dynamic fine-grained localization in Ad-Hoc networks of sensors. Proceedings 7th MOBICOM, pp. 166\u2013179 (2001)","DOI":"10.1145\/381677.381693"},{"key":"40_CR28","doi-asserted-by":"crossref","unstructured":"Savvides, A., Park, H., Srivastava, M.B.: The bits and flops of the n-hop multilateration primitive for node localization problems. Proceedings 1st WSNA, pp. 112\u2013121 (2002)","DOI":"10.1145\/570738.570755"},{"issue":"3","key":"40_CR29","doi-asserted-by":"crossref","first-page":"724","DOI":"10.2307\/1968654","volume":"36","author":"I.J. Schoenberg","year":"1935","unstructured":"Schoenberg I.J. (1935): Remarks to Maurice Fr\u00e9chet\u2019s Article \u201cSur la D\u00e9finition Axiomatique d\u2019une Classe d\u2019Espace Distanci\u00e9s Vectoriellement Applicable sur l\u2019Espace de Hilbert\u201d. Ann. Math. 36(3): 724\u2013732","journal-title":"Ann. Math."},{"key":"40_CR30","doi-asserted-by":"crossref","unstructured":"Shang, Y., Ruml, W., Zhang, Y., Fromherz, M.P.J.: Localization from mere connectivity. Proceedings 4th MOBIHOC, pp. 201\u2013212 (2003)","DOI":"10.1145\/778415.778439"},{"key":"40_CR31","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF02288916","volume":"17","author":"W.S. Torgerson","year":"1952","unstructured":"Torgerson W.S. (1952): Multidimensional scaling: I. theory and method. Psychometrika 17, 401\u2013419","journal-title":"Psychometrika"},{"key":"40_CR32","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1023\/A:1008722907820","volume":"17","author":"M.W. Trosset","year":"2000","unstructured":"Trosset M.W. (2000): Distance matrix completion by numerical optimization. Comput. Opt. Appl. 17, 11\u201322","journal-title":"Comput. Opt. Appl."},{"issue":"2","key":"40_CR33","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s001800200099","volume":"17","author":"M.W. Trosset","year":"2002","unstructured":"Trosset M.W. (2002): Extensions of classical multidimensional scaling via variable reduction. Comput. Stat. 17(2): 147\u2013162","journal-title":"Comput. Stat."},{"key":"40_CR34","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF02287916","volume":"3","author":"G. Young","year":"1938","unstructured":"Young G., Householder A.S. (1938): Discussion of a set of points in terms of their mutual distances. Psychometrika 3, 19\u201322","journal-title":"Psychometrika"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0040-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0040-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0040-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:01Z","timestamp":1559123401000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-006-0040-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9,19]]},"references-count":34,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2007,1,30]]}},"alternative-id":["40"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0040-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,9,19]]}}}