02378nam 2200517 450 991037621240332120180322114052.01-61197-307-4(CKB)3170000000002811(SSID)ssj0001120859(PQKBManifestationID)11711816(PQKBTitleCode)TC0001120859(PQKBWorkID)11160155(PQKB)11295142(OCoLC)1105039708(CaBNVSL)thg00979164(WaSeSS)IndRDA00011693(EXLCZ)993170000000002811PR135SIAM20190617d2010 uy 0engur|||||||||||txtccrProceedings of the Twenty First Annual ACM-SIAM Symposium on Discrete Algorithms /[edited by] Moses CharikarNew York, N.Y. :Association for Computing Machinery ;Philadelphia, Pennsylvania :Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104),[2010]PDFs (xviii, 1667 pages) illustrationsBibliographic Level Mode of Issuance: Monograph0-89871-701-9 0-89871-698-5 Includes bibliographical references and index.This 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.Computer algorithmsCongressesDiscrete mathematics and graph theoryComputer algorithms005.1Charikar MosesAssociation for Computing Machinery-Digital Library.CaBNVSLCaBNVSLCaBNVSLBOOK9910376212403321Proceedings of the Twenty First Annual ACM-SIAM Symposium on Discrete Algorithms2164099UNINA