LEADER 03793nam  22008055  450 
001 9910483162603321
005 20230329165311.0
010   $a3-319-13075-7
024 7 $a10.1007/978-3-319-13075-0
035   $a(CKB)3710000000306171
035   $a(SSID)ssj0001386325
035   $a(PQKBManifestationID)11716150
035   $a(PQKBTitleCode)TC0001386325
035   $a(PQKBWorkID)11373746
035   $a(PQKB)10372857
035   $a(DE-He213)978-3-319-13075-0
035   $a(MiAaPQ)EBC6295041
035   $a(MiAaPQ)EBC5594592
035   $a(Au-PeEL)EBL5594592
035   $a(OCoLC)897803157
035   $a(PPN)183094581
035   $a(EXLCZ)993710000000306171
100   $a20141107d2014      u|         0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aAlgorithms and Computation $e25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings /$fedited by Hee-Kap Ahn, Chan-Su Shin
205   $a1st ed. 2014.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2014.
215   $a1 online resource (XXII, 781 p. 144 illus.)
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8889
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-319-13074-9 
327   $aComputational 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.
330   $aThis 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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8889
606   $aAlgorithms
606   $aComputer science?Mathematics
606   $aDiscrete mathematics
606   $aComputer graphics
606   $aArtificial intelligence?Data processing
606   $aComputer science
606   $aAlgorithms
606   $aDiscrete Mathematics in Computer Science
606   $aComputer Graphics
606   $aData Science
606   $aComputer Science
615  0$aAlgorithms.
615  0$aComputer science?Mathematics.
615  0$aDiscrete mathematics.
615  0$aComputer graphics.
615  0$aArtificial intelligence?Data processing.
615  0$aComputer science.
615 14$aAlgorithms.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aComputer Graphics.
615 24$aData Science.
615 24$aComputer Science.
676   $a005.1
702   $aAhn$b Hee-Kap$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aShin$b Chan-Su$4edt$4http://id.loc.gov/vocabulary/relators/edt
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910483162603321
996   $aAlgorithms and Computation$9771857
997   $aUNINA