L’édition demandée n’est plus disponible, nous vous proposons la dernière édition.
Frontiers in Algorithmics, 1st ed. 2017 11th International Workshop, FAW 2017, Chengdu, China, June 23-25, 2017, Proceedings Theoretical Computer Science and General Issues Series
Coordonnateurs : Xiao Mingyu, Rosamond Frances
The 24 papers presented in this volume were carefully reviewed and selected from 61 submissions. They deal with all aspects of theoretical computer science and algorithms.
Includes supplementary material: sn.pub/extras
Date de parution : 05-2017
Ouvrage de 281 p.
15.5x23.5 cm
Thèmes de Frontiers in Algorithmics :
Mots-clés :
graph theory; approximation algorithms; problem solving; approximation theory; optimal systems; competitive ratio; graph theory; vertex set; probabilistic computation; proof complexity; graph algorithms analysis; mathematical optimization; online algorithms; parameterized complexity; exact algorithms; algorithmic game theory; algorithm analysis and problem complexity; data structures