|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
b3282673 |
| 003 |
MWH |
| 005 |
20191025072039.0 |
| 007 |
cr nn 008mamaa |
| 008 |
141107s2014 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783319130750
|
| 024 |
7 |
|
|a 10.1007/978-3-319-13075-0
|2 doi
|
| 035 |
|
|
|a (DE-He213)978-3-319-13075-0
|
| 050 |
|
4 |
|a E-Book
|
| 072 |
|
7 |
|a UMB
|2 bicssc
|
| 072 |
|
7 |
|a COM051300
|2 bisacsh
|
| 072 |
|
7 |
|a UMB
|2 thema
|
| 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 ;
|v 8889
|
| 490 |
1 |
|
|a Springer eBook Collection
|
| 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.
|
| 590 |
|
|
|a Loaded electronically.
|
| 590 |
|
|
|a Electronic access restricted to members of the Holy Cross Community.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer science—Mathematics.
|
| 650 |
|
0 |
|a Computer graphics.
|
| 650 |
|
0 |
|a Data structures (Computer science).
|
| 650 |
|
0 |
|a Computer science.
|
| 690 |
|
|
|a Electronic resources (E-books)
|
| 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 eBooks
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues ;
|v 8889
|
| 830 |
|
0 |
|a Springer eBook Collection.
|
| 856 |
4 |
0 |
|u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/978-3-319-13075-0
|3 Click to view e-book
|t 0
|
| 907 |
|
|
|a .b32826734
|b 04-18-22
|c 02-26-20
|
| 998 |
|
|
|a he
|b 02-26-20
|c m
|d @
|e -
|f eng
|g gw
|h 0
|i 1
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
| 902 |
|
|
|a springer purchased ebooks
|
| 903 |
|
|
|a SEB-COLL
|
| 945 |
|
|
|f - -
|g 1
|h 0
|j - -
|k - -
|l he
|o -
|p $0.00
|q -
|r -
|s b
|t 38
|u 0
|v 0
|w 0
|x 0
|y .i2195835x
|z 02-26-20
|
| 999 |
f |
f |
|i 59404adf-86a6-5574-8f6f-46461840e73a
|s 0e548040-227a-5d3b-bba5-d1cbbd1e2dd4
|t 0
|
| 952 |
f |
f |
|p Online
|a College of the Holy Cross
|b Main Campus
|c E-Resources
|d Online
|t 0
|e E-Book
|h Library of Congress classification
|i Elec File
|