Algorithms and Complexity - 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings

This book constitutes the refereed conference proceedings of the 10th International Conference on Algorithms and Complexity, CIAC 2017, held in Athens, Greece, in May 2017.
The 36 revised full papers were carefully reviewed and selected from 90 submissions and are presented together with 3 abstracts of invited talks and a paper to the 70th birthday of Stathis Zachos. The papers present original research in the theory and applications of algorithms and computational complexity.

Summary

This book constitutes the refereed conference proceedings of the 10th International Conference on Algorithms and Complexity, CIAC 2017, held in Athens, Greece, in May 2017.
The 36 revised full papers were carefully reviewed and selected from 90 submissions and are presented together with 3 abstracts of invited talks and a paper to the 70th birthday of Stathis Zachos. The papers present original research in the theory and applications of algorithms and computational complexity.

Product details

• Assisted by: Dimitris Fotakis (Editor), Aris Pagourtzis (Editor), Vangelis Th. Paschos (Editor)
• Publisher: Springer, Berlin
• Languages: English
• Product format: Paperback / Softback
• Released: 15.04.2017
• EAN: 9783319575858
• ISBN: 978-3-31-957585-8
• No. of pages: 486
• Dimensions: 154 mm x 29 mm x 235 mm
• Weight: 771 g
• Illustrations: XX, 486 p. 59 illus.
• Series: Lecture Notes in Computer Science; Theoretical Computer Science and General Issues
• Subjects: Natural sciences, medicine, IT, technology > Mathematics > Probability theory, stochastic theory, mathematical statistics; C, Data Science, Algorithms, Datenbanken, Diskrete Mathematik, Mathematik für Informatiker, computer science, game theory, Discrete Mathematics in Computer Science, Discrete Mathematics, Algorithms & data structures, Computer science—Mathematics, Maths for computer scientists, Algorithm Analysis and Problem Complexity, Data structures (Computer science), Data Structures, search algorithm, randomized algorithms, graph algorithms and graph drawing, inapproximability, exact and parameterized computation, online and streaming algorithms, evolutionarily stable strategies