02014nam 2200421 450 991037646410332120190619190106.01-61197-478-X(CKB)3710000001005891(OCoLC)1096646627(CaBNVSL)thg00979171(EXLCZ)993710000001005891PRDA17SIAM20190617d2017 uy 0engur|||||||||||rdacontentisbdmediardacarrierProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms /[editor] Philip N. KleinPhiladelphia, Pennsylvania :Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104),[2017]PDFs (x, 2747 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.1Klein Philip N140720Klein Philip N.Association for Computing Machinery-Digital Library.CaBNVSLCaBNVSLCaBNVSLBOOK9910376464103321Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms1955994UNINA