02007nam 2200421 450 991037577050332120230824151315.01-61197-548-4(CKB)4100000007389441(OCoLC)1105039710(CaBNVSL)thg00979173(EXLCZ)994100000007389441PRDA19SIAM20190617d2019 uy 0engur|||||||||||rdacontentisbdmediardacarrierProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms /[editor] Timothy M. ChanPhiladelphia, Pennsylvania :Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104),[2019]PDFs (ix, 2972 pages) illustrationsIncludes bibliographical references.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.1Chan Timothy M908884Chan Timothy M.Association for Computing Machinery-Digital Library.CaBNVSLCaBNVSLCaBNVSLBOOK9910375770503321Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms2032817UNINA