Cantitate/Preț
Produs

Combinatorial Algorithms: Lecture Notes in Computer Science, cartea 10765

Editat de Ljiljana Brankovic, Joe Ryan, William F. Smyth
en Limba Engleză Paperback – 17 apr 2018
This book constitutes the refereed post-conference proceedings of the 28th International Workshop
on Combinatorial Algorithms, IWOCA 2017, held in Newcastle, NSW, Australia, in July 2017.
The 30 regular papers presented in this volume together with 5 invited talks were carefully reviewed and selected from 55 submissions. They were organized in topical sessions named:  approximation algorithms and hardness; computational complexity; computational geometry; graphs and combinatorics; graph colourings, labellings and power domination; heuristics; mixed integer programming; polynomial algorithms; privacy; and string algorithms.

Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32974 lei

Preț vechi: 41217 lei
-20%

Puncte Express: 495

Preț estimativ în valută:
5832 6731$ 5040£

Carte tipărită la comandă

Livrare economică 01-15 mai


Specificații

ISBN-13: 9783319788241
ISBN-10: 3319788248
Pagini: 448
Ilustrații: XII, 434 p. 80 illus.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.67 kg
Ediția:1st ed. 2018
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Approximation algorithms and hardness.- Computational complexity.- Computational geometry.- Graphs and combinatorics.- Graph colourings, labellings and power domination.- Heuristics.- Mixed integer programming.- Polynomial algorithms.- Privacy.- String algorithms.