LEADER 02409nam 2200517 450 001 9910376384103321 005 20170925023815.0 010 $a1-61197-310-4 035 $a(CKB)3810000000000425 035 $a(SSID)ssj0001341803 035 $a(PQKBManifestationID)11751793 035 $a(PQKBTitleCode)TC0001341803 035 $a(PQKBWorkID)11278358 035 $a(PQKB)11150869 035 $a(OCoLC)889405799 035 $a(CaBNVSL)thg00979167 035 $a(WaSeSS)IndRDA00027577 035 $a(EXLCZ)993810000000000425 071 51$aPR143$bSIAM 100 $a20190617d2013 uy 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt 182 $cc 183 $acr 200 10$aProceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms /$fKhanna Sanjeev, editor 210 1$aNew York [New York] :$cAssociation for Computing Machinery ;$aPhiladelphia, Pennsylvania :$cSociety for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104),$d[2013] 215 $aPDFs (xix, 1915 pages) $cillustrations 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a1-61197-251-5 320 $aIncludes bibliographical references. 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 $aKhanna$b Sanjeev 712 02$aSIAM Activity Group on Discrete Mathematics 712 02$aACM Special Interest Group for Algorithms and Computation Theory 801 0$bCaBNVSL 801 1$bCaBNVSL 801 2$bCaBNVSL 906 $aBOOK 912 $a9910376384103321 996 $aProceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms$91984265 997 $aUNINA