LEADER 02378nam 2200517 450 001 9910376212403321 005 20180322114052.0 010 $a1-61197-307-4 035 $a(CKB)3170000000002811 035 $a(SSID)ssj0001120859 035 $a(PQKBManifestationID)11711816 035 $a(PQKBTitleCode)TC0001120859 035 $a(PQKBWorkID)11160155 035 $a(PQKB)11295142 035 $a(OCoLC)1105039708 035 $a(CaBNVSL)thg00979164 035 $a(WaSeSS)IndRDA00011693 035 $a(EXLCZ)993170000000002811 071 51$aPR135$bSIAM 100 $a20190617d2010 uy 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt 182 $cc 183 $acr 200 10$aProceedings of the Twenty First Annual ACM-SIAM Symposium on Discrete Algorithms /$f[edited by] Moses Charikar 210 1$aNew York, N.Y. :$cAssociation for Computing Machinery ;$aPhiladelphia, Pennsylvania :$cSociety for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104),$d[2010] 215 $aPDFs (xviii, 1667 pages) $cillustrations 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a0-89871-701-9 311 $a0-89871-698-5 320 $aIncludes bibliographical references and index. 330 3 $aThis symposium focuses on research topics related to efficient algorithms and data structures for discrete problems. In addition to the design of such methods and structures, the scope also includes their use, performance analysis, and the mathematical problems related to their development or limitations. Performance analyses may be analytical or experimental and may address worst-case or expected-case performance. Studies can be theoretical or based on data sets that have arisen in practice and may address methodological issues involved in performance analysis. 606 $aComputer algorithms$vCongresses 610 $aDiscrete mathematics and graph theory 615 0$aComputer algorithms 676 $a005.1 702 $aCharikar$b Moses 712 02$aAssociation for Computing Machinery-Digital Library. 801 0$bCaBNVSL 801 1$bCaBNVSL 801 2$bCaBNVSL 906 $aBOOK 912 $a9910376212403321 996 $aProceedings of the Twenty First Annual ACM-SIAM Symposium on Discrete Algorithms$92164099 997 $aUNINA