Atjaunināt sīkdatņu piekrišanu

WALCOM: Algorithms and Computation: 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 2931, 2017, Proceedings 1st ed. 2017 [Mīkstie vāki]

Edited by , Edited by , Edited by
  • Formāts: Paperback / softback, 474 pages, height x width: 235x155 mm, weight: 7431 g, 109 Illustrations, black and white; XXII, 474 p. 109 illus., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 10167
  • Izdošanas datums: 21-Feb-2017
  • Izdevniecība: Springer International Publishing AG
  • ISBN-10: 3319539248
  • ISBN-13: 9783319539249
  • Mīkstie vāki
  • Cena: 46,91 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 55,19 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 474 pages, height x width: 235x155 mm, weight: 7431 g, 109 Illustrations, black and white; XXII, 474 p. 109 illus., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 10167
  • Izdošanas datums: 21-Feb-2017
  • Izdevniecība: Springer International Publishing AG
  • ISBN-10: 3319539248
  • ISBN-13: 9783319539249
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.

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