{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T18:09:04Z","timestamp":1725991744475},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662580387"},{"type":"electronic","value":"9783662580394"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-662-58039-4_6","type":"book-chapter","created":{"date-parts":[[2018,9,16]],"date-time":"2018-09-16T06:39:40Z","timestamp":1537079980000},"page":"97-114","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Distance Matrix Completion Approach to 1-Round Algorithms for Point Placement in the Plane"],"prefix":"10.1007","author":[{"given":"Md. Zamilur","family":"Rahman","sequence":"first","affiliation":[]},{"given":"Udayamoorthy Navaneetha","family":"Krishnan","sequence":"additional","affiliation":[]},{"given":"Cory","family":"Jeane","sequence":"additional","affiliation":[]},{"given":"Asish","family":"Mukhopadhyay","sequence":"additional","affiliation":[]},{"given":"Yash P.","family":"Aneja","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,16]]},"reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1016\/j.dam.2005.07.014","volume":"154","author":"P Damaschke","year":"2006","unstructured":"Damaschke, P.: Randomized vs. deterministic distance query strategies for point location on the line. Discrete Appl. Math. 154(3), 478\u2013484 (2006)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0166-218X(02)00284-6","volume":"127","author":"P Damaschke","year":"2003","unstructured":"Damaschke, P.: Point placement on the line by distance data. Discrete Appl. Math. 127(1), 53\u201362 (2003)","journal-title":"Discrete Appl. Math."},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-74126-8_35","volume-title":"Algorithms in Bioinformatics","author":"FYL Chin","year":"2007","unstructured":"Chin, F.Y.L., Leung, H.C.M., Sung, W.K., Yiu, S.M.: The point placement problem on a line-improved bounds for pairwise distance queries. In: Giancarlo, R., Hannenhalli, S. (eds.) WABI 2007. LNCS, vol. 4645, pp. 372\u2013382. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-74126-8_35"},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.7155\/jgaa.00317","volume":"18","author":"MS Alam","year":"2014","unstructured":"Alam, M.S., Mukhopadhyay, A.: More on generalized jewels and the point placement problem. J. Graph Algorithms Appl. 18(1), 133\u2013173 (2014)","journal-title":"J. Graph Algorithms Appl."},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-14974-5_4","volume-title":"Algorithms and Discrete Applied Mathematics","author":"MS Alam","year":"2015","unstructured":"Alam, M.S., Mukhopadhyay, A.: Three paths to point placement. In: Ganguly, S., Krishnamurti, R. (eds.) CALDAM 2015. LNCS, vol. 8959, pp. 33\u201344. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-14974-5_4"},{"issue":"12","key":"6_CR6","doi-asserted-by":"publisher","first-page":"1663","DOI":"10.1109\/TMC.2006.174","volume":"5","author":"J Aspnes","year":"2006","unstructured":"Aspnes, J., et al.: A theory of network localization. IEEE Trans. Mobile Comput. 5(12), 1663\u20131678 (2006)","journal-title":"IEEE Trans. Mobile Comput."},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1145\/1149283.1149286","volume":"2","author":"P Biswas","year":"2006","unstructured":"Biswas, P., Liang, T., Wang, T., Ye, Y.: Semidefinite programming based algorithms for sensor network localization. TOSN 2(2), 188\u2013220 (2006)","journal-title":"TOSN"},{"issue":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"724","DOI":"10.2307\/1968654","volume":"36","author":"IJ Schoenberg","year":"1935","unstructured":"Schoenberg, I.J.: Remarks to Maurice Fretchet\u2019s article \u201csur la definition axiomatique d\u2019une classe d\u2019espace distancis vectoriellement applicable sur l\u2019espace de Hilbert\". Ann. Math. 36(3), 724\u2013731 (1935)","journal-title":"Ann. Math."},{"issue":"1","key":"6_CR9","doi-asserted-by":"publisher","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(1), 19\u201322 (1938)","journal-title":"Psychometrika"},{"issue":"1","key":"6_CR10","first-page":"1","volume":"6","author":"A Mukhopadhyay","year":"2016","unstructured":"Mukhopadhyay, A., Sarker, P.K., Kannan, K.K.V.: Point placement algorithms: an experimental study. Int. J. Exp. Algorithms 6(1), 1\u201313 (2016)","journal-title":"Int. J. Exp. Algorithms"},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1137\/S0895479893249757","volume":"16","author":"M Bakonyi","year":"1995","unstructured":"Bakonyi, M., Johnson, C.R.: The euclidian distance matrix completion problem. SIAM J. Matrix Anal. Appl. 16(2), 646\u2013654 (1995)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"10","key":"6_CR12","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1002\/jcc.10234","volume":"24","author":"DK Agrafiotis","year":"2003","unstructured":"Agrafiotis, D.K.: Stochastic proximity embedding. J. Comput. Chem. 24(10), 1215\u20131221 (2003)","journal-title":"J. Comput. Chem."},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0024-3795(84)90207-6","volume":"58","author":"R Grone","year":"1984","unstructured":"Grone, R., Johnson, C.R., Sa, E.M., Wolkowicz, H.: Positive definite completions of partial hermitian matrices. Linear Algebra Appl. 58, 109\u2013124 (1984)","journal-title":"Linear Algebra Appl."},{"issue":"9","key":"6_CR15","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1080\/03081089008817973","volume":"26","author":"R Ellis","year":"1990","unstructured":"Ellis, R., Lay, D.: Rank-preserving extensions of band matrices. Linear Multilinear Algebra 26, 147\u2013179 (1990)","journal-title":"Linear Multilinear Algebra"},{"issue":"5","key":"6_CR17","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1107\/S0567739476001873","volume":"32","author":"W Kabsch","year":"1976","unstructured":"Kabsch, W.: A solution for the best rotation to relate two sets of vectors. Acta Crystallogr. A 32(5), 922\u2013923 (1976)","journal-title":"Acta Crystallogr. A"},{"issue":"1","key":"6_CR18","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10479-007-0190-4","volume":"157","author":"L Markenzon","year":"2008","unstructured":"Markenzon, L., Vernet, O., Araujo, L.H.: Two methods for the generation of chordal graphs. Ann. OR 157(1), 47\u201360 (2008)","journal-title":"Ann. OR"}],"container-title":["Lecture Notes in Computer Science","Transactions on Computational Science XXXIII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-58039-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,16]],"date-time":"2018-09-16T06:46:52Z","timestamp":1537080412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-58039-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783662580387","9783662580394"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-58039-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}