Syndetics omslagsbild
Bild från Syndetics

WALCOM: Algorithms and Computation [electronic resource] : 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017, Proceedings / edited by Sheung-Hung Poon, Md. Saidur Rahman, Hsu-Chun Yen.

Medverkande: Materialtyp: TextSerie: Utgivningsuppgift: Cham : Springer International Publishing : Imprint: Springer, 2017Utgåva: 1st ed. 2017Beskrivning: XXII, 474 p. 109 illus. online resourceInnehållstyp:
  • text
Medietyp:
  • computer
Bärartyp:
  • online resource
ISBN:
  • 9783319539256
Ämnen: DDK-klassifikation:
  • 518.1 23
Onlineresurser:
Innehåll:
Invited talks -- Computational geometry -- Combinatorial optimization -- Graph drawing -- Graph algorithms -- Space-efficient algorithms -- Computational complexity -- Approximation algorithms.
Sammanfattning: 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. .
Inga fysiska exemplar för denna post

Invited talks -- Computational geometry -- Combinatorial optimization -- Graph drawing -- Graph algorithms -- Space-efficient algorithms -- Computational complexity -- Approximation algorithms.

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. .

Licensed e-book