LEADER 01379oam  2200421Ia 450 
001 9910699392503321
005 20230902162117.0
035   $a(CKB)5470000002401987
035   $a(OCoLC)318690428
035   $a(EXLCZ)995470000002401987
100   $a20090122d2008      ua             0
101 0 $aeng
135   $aurbn|||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aFinding a minimum covering circle based on infinity norms$b[electronic resource] /$fby Andrew A. Thompson
210  1$aAberdeen Proving Ground, MD :$cArmy Research Laboratory,$d[2008]
215   $a1 online resource (20 unnumbered pages) $cillustrations
225 1 $aARL-TR ;$v4495
300   $aTitle from title screen (viewed Jan. 28, 2010).
300   $a"July 2008."
410  0$aARL-TR (Aberdeen Proving Ground, Md.) ;$v4495.
606   $aAlgorithms
606   $aVersification
606   $aIterative methods (Mathematics)
615  0$aAlgorithms.
615  0$aVersification.
615  0$aIterative methods (Mathematics)
700   $aThompson$b Andrew A$01391480
712 02$aU.S. Army Research Laboratory.
801  0$bDTICE
801  1$bDTICE
801  2$bGPO
906   $aBOOK
912   $a9910699392503321
996   $aFinding a minimum covering circle based on infinity norms$93500997
997   $aUNINA