LEADER 02107nam0 2200517 i 450 001 VAN0123996 005 20230703015357.80 017 70$2N$a9783319607924 100 $a20191007d2017 |0itac50 ba 101 $aeng 102 $aCH 105 $a|||| ||||| 200 1 $aEuclidean Distance Geometry$ean introduction $fLeo Liberti, Carlile Lavor 210 $aCham$cSpringer$d2017 215 $axiii, 133 p.$cill.$d24 cm 410 1$1001VAN0100987$12001 $aSpringer undergraduate texts in mathematics and technology$1210 $aBerlin [etc.]$cSpringer 500 1$3VAN0235580$aEuclidean Distance Geometry$91562447 606 $a51Kxx$xDistance geometry [MSC 2020]$3VANC025289$2MF 610 $aBranch-and-Prune algorithm$9KW:K 610 $aClock synchronization$9KW:K 610 $aComplete graphs$9KW:K 610 $aConvex Optimization$9KW:K 610 $aDimensionality reduction$9KW:K 610 $aDiscretizability$9KW:K 610 $aGraph visualization$9KW:K 610 $aIsomap$9KW:K 610 $aK-laterative graphs$9KW:K 610 $aLocalization of sensor networks$9KW:K 610 $aMathematica$9KW:K 610 $aMathematical programming$9KW:K 610 $aMultidimensional Scaling$9KW:K 610 $aUnmanned underwater vehicles$9KW:K 610 $aVertex orders$9KW:K 610 $aWeighted adjacency matrix$9KW:K 620 $aCH$dCham$3VANL001889 700 1$aLiberti$bLeo$3VANV095473$0767458 701 1$aLavor$bCarlile$3VANV095474$0767459 712 $aSpringer $3VANV108073$4650 801 $aIT$bSOL$c20240405$gRICA 856 4 $uhttp://doi.org/10.1007/978-3-319-60792-4$zE-book ? Accesso al full-text attraverso riconoscimento IP di Ateneo, proxy e/o Shibboleth 899 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$1IT-CE0120$2VAN08 912 $fN 912 $aVAN0123996 950 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$d08CONS e-book 0643 $e08eMF643 20191007 996 $aEuclidean Distance Geometry$91562447 997 $aUNICAMPANIA