000 | 03474nam a22006135i 4500 | ||
---|---|---|---|
001 | 978-3-319-13075-0 | ||
003 | DE-He213 | ||
005 | 20240730172552.0 | ||
007 | cr nn 008mamaa | ||
008 | 141107s2014 sz | s |||| 0|eng d | ||
020 |
_a9783319130750 _9978-3-319-13075-0 |
||
024 | 7 |
_a10.1007/978-3-319-13075-0 _2doi |
|
050 | 4 | _aQA76.9.A43 | |
072 | 7 |
_aUMB _2bicssc |
|
072 | 7 |
_aCOM051300 _2bisacsh |
|
072 | 7 |
_aUMB _2thema |
|
082 | 0 | 4 |
_a518.1 _223 |
245 | 1 | 0 |
_aAlgorithms and Computation _h[electronic resource] : _b25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings / _cedited by Hee-Kap Ahn, Chan-Su Shin. |
250 | _a1st ed. 2014. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2014. |
|
300 |
_aXXII, 781 p. 144 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v8889 |
|
505 | 0 | _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. | |
520 | _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. | ||
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 0 |
_aComputer science _xMathematics. _93866 |
|
650 | 0 |
_aDiscrete mathematics. _912873 |
|
650 | 0 |
_aComputer graphics. _94088 |
|
650 | 0 |
_aArtificial intelligence _xData processing. _921787 |
|
650 | 0 |
_aComputer science. _99832 |
|
650 | 1 | 4 |
_aAlgorithms. _93390 |
650 | 2 | 4 |
_aDiscrete Mathematics in Computer Science. _931837 |
650 | 2 | 4 |
_aComputer Graphics. _94088 |
650 | 2 | 4 |
_aData Science. _934092 |
650 | 2 | 4 |
_aComputer Science. _99832 |
700 | 1 |
_aAhn, Hee-Kap. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9104343 |
|
700 | 1 |
_aShin, Chan-Su. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9104345 |
|
710 | 2 |
_aSpringerLink (Online service) _9104348 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783319130743 |
776 | 0 | 8 |
_iPrinted edition: _z9783319130767 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v8889 _9104350 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-319-13075-0 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c88390 _d88390 |