|
|
|
|
LEADER |
02155nmm a2200385 u 4500 |
001 |
EB001346528 |
003 |
EBX01000000000000000900718 |
005 |
00000000000000.0 |
007 |
cr||||||||||||||||||||| |
008 |
170301 ||| eng |
020 |
|
|
|a 9783319539256
|
100 |
1 |
|
|a Poon, Sheung-Hung
|e [editor]
|
245 |
0 |
0 |
|a WALCOM: Algorithms and Computation
|h Elektronische Ressource
|b 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017, Proceedings
|c edited by Sheung-Hung Poon, Md. Saidur Rahman, Hsu-Chun Yen
|
250 |
|
|
|a 1st ed. 2017
|
260 |
|
|
|a Cham
|b Springer International Publishing
|c 2017, 2017
|
300 |
|
|
|a XXII, 474 p. 109 illus
|b online resource
|
505 |
0 |
|
|a Invited talks -- Computational geometry -- Combinatorial optimization -- Graph drawing -- Graph algorithms -- Space-efficient algorithms -- Computational complexity -- Approximation algorithms
|
653 |
|
|
|a Computer graphics
|
653 |
|
|
|a Computer science / Mathematics
|
653 |
|
|
|a Numerical Analysis
|
653 |
|
|
|a Discrete Mathematics in Computer Science
|
653 |
|
|
|a Computer Graphics
|
653 |
|
|
|a Algorithms
|
653 |
|
|
|a Mathematical Applications in Computer Science
|
653 |
|
|
|a Numerical analysis
|
653 |
|
|
|a Discrete mathematics
|
700 |
1 |
|
|a Rahman, Md. Saidur
|e [editor]
|
700 |
1 |
|
|a Yen, Hsu-Chun
|e [editor]
|
041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
490 |
0 |
|
|a Theoretical Computer Science and General Issues
|
028 |
5 |
0 |
|a 10.1007/978-3-319-53925-6
|
856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-319-53925-6?nosfx=y
|x Verlag
|3 Volltext
|
082 |
0 |
|
|a 518.1
|
520 |
|
|
|a 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.
|