Atjaunināt sīkdatņu piekrišanu

WALCOM: Algorithms and Computation: 10th International Workshop, WALCOM 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings 1st ed. 2016 [Mīkstie vāki]

Edited by , Edited by
  • Formāts: Paperback / softback, 362 pages, height x width: 235x155 mm, weight: 5796 g, 82 Illustrations, color; XIX, 362 p. 82 illus. in color., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 9627
  • Izdošanas datums: 22-Feb-2016
  • Izdevniecība: Springer International Publishing AG
  • ISBN-10: 3319301381
  • ISBN-13: 9783319301389
Citas grāmatas par šo tēmu:
  • 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
WALCOM: Algorithms and Computation: 10th International Workshop, WALCOM 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings 1st ed. 2016Palielināt
  • Formāts: Paperback / softback, 362 pages, height x width: 235x155 mm, weight: 5796 g, 82 Illustrations, color; XIX, 362 p. 82 illus. in color., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 9627
  • Izdošanas datums: 22-Feb-2016
  • Izdevniecība: Springer International Publishing AG
  • ISBN-10: 3319301381
  • ISBN-13: 9783319301389
Citas grāmatas par šo tēmu:
Permanent link: https://www.kriso.lv/db/9783319301389.html
Keywords:
This book constitutes the proceedings of the 10th International Workshop on Algorithms and Computation, WALCOM 2016, held in Kathmandu, Nepal, in March 2016.

The 27 full papers presented together with 4 invited talks were carefully reviewed and selected from 68 submissions. The papers cover a wide range of topics such as approximation algorithms, computational complexity, computational geometry, data structures, graph algorithms, graph coloring, graph exploration, and online algorithms.