| 000 | 03980nam a22006615i 4500 | ||
|---|---|---|---|
| 001 | 978-3-319-53925-6 | ||
| 003 | DE-He213 | ||
| 005 | 20210118122739.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 170220s2017 gw | s |||| 0|eng d | ||
| 020 |
_a9783319539256 _9978-3-319-53925-6 |
||
| 024 | 7 |
_a10.1007/978-3-319-53925-6 _2doi |
|
| 050 | 4 | _aQA76.9.A43 | |
| 072 | 7 |
_aUMB _2bicssc |
|
| 072 | 7 |
_aCOM051300 _2bisacsh |
|
| 072 | 7 |
_aUMB _2thema |
|
| 082 | 0 | 4 |
_a005.1 _223 |
| 245 | 1 | 0 |
_aWALCOM: Algorithms and Computation _h[electronic resource] : _b11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29–31, 2017, Proceedings / _cedited by Sheung-Hung Poon, Md. Saidur Rahman, Hsu-Chun Yen. |
| 250 | _a1st ed. 2017. | ||
| 264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2017. |
|
| 300 |
_aXXII, 474 p. 109 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 ; _v10167 |
|
| 505 | 0 | _aInvited talks -- Computational geometry -- Combinatorial optimization -- Graph drawing -- Graph algorithms -- Space-efficient algorithms -- Computational complexity -- Approximation algorithms. | |
| 520 | _aThis book constitutes the proceedings of the 11th International Workshop on Algorithms and Computation, WALCOM 2017, held in Hsinchu, Taiwan, in March 2017. The 35 full papers presented together with three invited talks were carefully reviewed and selected from 83 submissions. The papers are organized in topical sections on invited talks; computational geometry; combinatorial optimization; graph drawing; graph algorithms; space-efficient algorithms; computational complexity; approximation algorithms. . | ||
| 650 | 0 | _aAlgorithms. | |
| 650 | 0 | _aComputer science—Mathematics. | |
| 650 | 0 | _aNumerical analysis. | |
| 650 | 0 | _aComputer graphics. | |
| 650 | 1 | 4 |
_aAlgorithm Analysis and Problem Complexity. _0http://scigraph.springernature.com/things/product-market-codes/I16021 |
| 650 | 2 | 4 |
_aDiscrete Mathematics in Computer Science. _0http://scigraph.springernature.com/things/product-market-codes/I17028 |
| 650 | 2 | 4 |
_aNumeric Computing. _0http://scigraph.springernature.com/things/product-market-codes/I1701X |
| 650 | 2 | 4 |
_aMath Applications in Computer Science. _0http://scigraph.springernature.com/things/product-market-codes/I17044 |
| 650 | 2 | 4 |
_aComputer Graphics. _0http://scigraph.springernature.com/things/product-market-codes/I22013 |
| 650 | 2 | 4 |
_aAlgorithms. _0http://scigraph.springernature.com/things/product-market-codes/M14018 |
| 700 | 1 |
_aPoon, Sheung-Hung. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aRahman, Md. Saidur. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aYen, Hsu-Chun. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783319539249 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783319539263 |
| 830 | 0 |
_aTheoretical Computer Science and General Issues ; _v10167 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-319-53925-6 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-LNC | ||
| 999 |
_c445788 _d445788 |
||
| 942 | _cEB | ||
| 506 | _aAvailable to subscribing member institutions only. Доступно лише організаціям членам підписки. | ||
| 506 | _fOnline access from local network of NaUOA. | ||
| 506 | _fOnline access with authorization at https://link.springer.com/ | ||
| 506 | _fОнлайн-доступ з локальної мережі НаУОА. | ||
| 506 | _fОнлайн доступ з авторизацією на https://link.springer.com/ | ||