Algorithms and Computation, 2014 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings Theoretical Computer Science and General Issues Series
Coordonnateurs : Ahn Hee-Kap, Shin Chan-Su
The 60 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 171 submissions for inclusion in the book. The focus of the volume in on the following topics: computational geometry, combinatorial optimization, graph algorithms: enumeration, matching and assignment, data structures and algorithms, fixed-parameter tractable algorithms, scheduling algorithms, computational complexity, computational complexity, approximation algorithms, graph theory and algorithms, online and approximation algorithms, and network and scheduling algorithms.
Includes supplementary material: sn.pub/extras
Date de parution : 11-2014
Ouvrage de 781 p.
15.5x23.5 cm
Disponible chez l'éditeur (délai d'approvisionnement : 15 jours).
Prix indicatif 116,04 €
Ajouter au panierThèmes d’Algorithms and Computation :
Mots-clés :
Algorithmic Game Theory; Algorithms; Approximation; Approximation Algorithms; Combinatorial Optimization; Computational Biology; Computational Complexity; Computational Geometry; Cryptography; Data Structures; Distributed Algorithms; Experimental Algorithms; Graph Algorithms; Graph Drawing; Internet Algorithms; Online Algorithms; Parallel Algorithms; Polynomial Time; Quantum Computing; Randomized Algorithms; algorithm analysis and problem complexity