Description
WALCOM: Algorithms and Computation, 1st ed. 2017
11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017, Proceedings
Theoretical Computer Science and General Issues Series
Coordinators: Poon Sheung-Hung, Rahman Md. Saidur, Yen Hsu-Chun
Language: English
Subjects for WALCOM: Algorithms and Computation:
Keywords
approximation algorithms; combinatorial optimization; computational complexity; graph algorithms; theory of computation; clustering; computational geometry; dynamic graphs; graph drawing; oblivious; parameterized complexity; pathwidth; polygonal obstacle; resolution size; satisfiability; simple-triangle graphs; space-efficient algorithms; structure analysis; submodularity; swarm robots
Support: Print on demand
Description
/li>Contents
/li>
This book constitutes the proceedings of the 11th International Workshop on Algorithms and Computation, WALCOM 2017, held in Hsinchu, Taiwan, in March 2017.
The 35 full papers presented together with three invited talks were carefully reviewed and selected from 83 submissions. The papers are organized in topical sections on invited talks; computational geometry; combinatorial optimization; graph drawing; graph algorithms; space-efficient algorithms; computational complexity; approximation algorithms.
Invited talks.- Computational geometry.- Combinatorial optimization.- Graph drawing.- Graph algorithms.- Space-efficient algorithms.- Computational complexity.- Approximation algorithms.
