Algorithms and Complexity, 1st ed. 2017 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings Theoretical Computer Science and General Issues Series
Coordonnateurs : Fotakis Dimitris, Pagourtzis Aris, Paschos Vangelis Th.
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.
Includes supplementary material: sn.pub/extras
Includes supplementary material: sn.pub/extras
Date de parution : 04-2017
Ouvrage de 486 p.
15.5x23.5 cm
Thèmes d’Algorithms and Complexity :
Mots-clés :
algorithm engineering; computational complexity; discrete optimization; parallel and distributed algorithms; theoretical computer science; algorithmic aspects of communication networks; algorithmic game theory; algorithms; approximation algorithms; complexity theory; computational geometry; data structures; evolutionarily stable strategies; exact and parameterized computation; game theory; graph algorithms and graph drawing; inapproximability; online and streaming algorithms; randomized algorithms; search algorith