Cargando…

Algorithms and Computation 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings /

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 incl...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Ahn, Hee-Kap (Editor ), Shin, Chan-Su (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Cham : Springer International Publishing : Imprint: Springer, 2014.
Edición:1st ed. 2014.
Colección:Theoretical Computer Science and General Issues, 8889
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-319-13075-0
003 DE-He213
005 20230329165311.0
007 cr nn 008mamaa
008 141107s2014 sz | s |||| 0|eng d
020 |a 9783319130750  |9 978-3-319-13075-0 
024 7 |a 10.1007/978-3-319-13075-0  |2 doi 
050 4 |a QA76.9.A43 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
072 7 |a UMB  |2 thema 
082 0 4 |a 518.1  |2 23 
245 1 0 |a Algorithms and Computation  |h [electronic resource] :  |b 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings /  |c edited by Hee-Kap Ahn, Chan-Su Shin. 
250 |a 1st ed. 2014. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2014. 
300 |a XXII, 781 p. 144 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 8889 
505 0 |a 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. 
520 |a 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. 
650 0 |a Algorithms. 
650 0 |a Computer science-Mathematics. 
650 0 |a Discrete mathematics. 
650 0 |a Computer graphics. 
650 0 |a Artificial intelligence-Data processing. 
650 0 |a Computer science. 
650 1 4 |a Algorithms. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Computer Graphics. 
650 2 4 |a Data Science. 
650 2 4 |a Computer Science. 
700 1 |a Ahn, Hee-Kap.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Shin, Chan-Su.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783319130767 
776 0 8 |i Printed edition:  |z 9783319130743 
830 0 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 8889 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-319-13075-0  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)