Atjaunināt sīkdatņu piekrišanu

Frontiers in Algorithmics: 14th International Workshop, FAW 2020, Haikou, China, October 19-21, 2020, Proceedings 1st ed. 2020 [Mīkstie vāki]

Edited by
  • Formāts: Paperback / softback, 145 pages, height x width: 235x155 mm, weight: 454 g, 2 Illustrations, color; 49 Illustrations, black and white; IX, 145 p. 51 illus., 2 illus. in color., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 12340
  • Izdošanas datums: 23-Sep-2020
  • Izdevniecība: Springer Nature Switzerland AG
  • ISBN-10: 3030599000
  • ISBN-13: 9783030599003
  • 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, 145 pages, height x width: 235x155 mm, weight: 454 g, 2 Illustrations, color; 49 Illustrations, black and white; IX, 145 p. 51 illus., 2 illus. in color., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 12340
  • Izdošanas datums: 23-Sep-2020
  • Izdevniecība: Springer Nature Switzerland AG
  • ISBN-10: 3030599000
  • ISBN-13: 9783030599003
This book constitutes the proceedings of the 14th International Workshop on Frontiers in Algorithmics, FAW 2020, held in Haikou, China, in May 2020. The conference was held virtually due to the COVID-19 pandemic. The 12 full papers presented in this volume were carefully reviewed and selected from 15 submissions.
The workshop provides a focused forum on current trends of research on algorithms, discrete structures, and their applications, and brings together international experts at the research frontiers in these areas to exchange ideas and to present significant new results. The papers detail graph theory, scheduling and algorithm and complexity.