Cantitate/Preț
Produs

Algorithms and Computation: 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings: Lecture Notes in Computer Science, cartea 8889

Editat de Hee-Kap Ahn, Chan-Su Shin
en Limba Engleză Paperback – 20 noi 2014
This book constitutes the refereed proceedings of the 25th International Symposium on Algorithms and Computation, ISAAC 2014, held in Jeonju, Korea, in December 2014.
The 60 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 171 submissions for inclusion in the book. The focus of the volume in on the following topics: computational geometry, combinatorial optimization, graph algorithms: enumeration, matching and assignment, data structures and algorithms, fixed-parameter tractable algorithms, scheduling algorithms, computational complexity, computational complexity, approximation algorithms, graph theory and algorithms, online and approximation algorithms, and network and scheduling algorithms.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 64502 lei

Preț vechi: 80626 lei
-20% Nou

Puncte Express: 968

Preț estimativ în valută:
12345 13023$ 10288£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319130743
ISBN-10: 3319130749
Pagini: 781
Ilustrații: XXII, 781 p. 144 illus.
Dimensiuni: 155 x 235 x 43 mm
Greutate: 1.1 kg
Ediția:2014
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Public țintă

Research

Cuprins

Computational geometry.- Combinatorial optimization.- Graph algorithms.- Enumeration, matching and assignment.- Data structures and algorithms.- Fixed-parameter tractable algorithms.- Scheduling algorithms.- Computational complexity.- Approximation algorithms, graph theory and algorithms.- Online and approximation algorithms.- Network and scheduling algorithms.

Caracteristici

Includes supplementary material: sn.pub/extras