000 | 04124nam a22006735i 4500 | ||
---|---|---|---|
001 | 978-3-319-78825-8 | ||
003 | DE-He213 | ||
005 | 20210201191413.0 | ||
007 | cr nn 008mamaa | ||
008 | 180416s2018 gw | s |||| 0|eng d | ||
020 |
_a9783319788258 _9978-3-319-78825-8 |
||
050 | 4 | _aQA76.9.M35 | |
072 | 7 |
_aPBD _2bicssc |
|
072 | 7 |
_aCOM018000 _2bisacsh |
|
072 | 7 |
_aPBD _2thema |
|
072 | 7 |
_aUYAM _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aCombinatorial Algorithms _h[electronic resource] : _b28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers / _cedited by Ljiljana Brankovic, Joe Ryan, William F. Smyth. |
250 | _a1st ed. 2018. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2018. |
|
300 |
_aXII, 434 p. 80 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 ; _v10765 |
|
500 | _aAcceso multiusuario | ||
505 | 0 | _aApproximation algorithms and hardness -- Computational complexity -- Computational geometry -- Graphs and combinatorics -- Graph colourings, labellings and power domination -- Heuristics -- Mixed integer programming -- Polynomial algorithms -- Privacy -- String algorithms. | |
520 | _aThis book constitutes the refereed post-conference proceedings of the 28th International Workshop on Combinatorial Algorithms, IWOCA 2017, held in Newcastle, NSW, Australia, in July 2017. The 30 regular papers presented in this volume together with 5 invited talks were carefully reviewed and selected from 55 submissions. They were organized in topical sessions named: approximation algorithms and hardness; computational complexity; computational geometry; graphs and combinatorics; graph colourings, labellings and power domination; heuristics; mixed integer programming; polynomial algorithms; privacy; and string algorithms. | ||
541 |
_fUABC ; _cTemporal ; _d01/01/2021-12/31/2023. |
||
650 | 0 | _aComputer science-Mathematics. | |
650 | 0 | _aAlgorithms. | |
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aArtificial intelligence. | |
650 | 0 | _aNumerical analysis. | |
650 | 0 | _aComputer security. | |
650 | 1 | 4 |
_aDiscrete Mathematics in Computer Science. _0https://scigraph.springernature.com/ontologies/product-market-codes/I17028 |
650 | 2 | 4 |
_aAlgorithm Analysis and Problem Complexity. _0https://scigraph.springernature.com/ontologies/product-market-codes/I16021 |
650 | 2 | 4 |
_aData Structures. _0https://scigraph.springernature.com/ontologies/product-market-codes/I15017 |
650 | 2 | 4 |
_aArtificial Intelligence. _0https://scigraph.springernature.com/ontologies/product-market-codes/I21000 |
650 | 2 | 4 |
_aNumeric Computing. _0https://scigraph.springernature.com/ontologies/product-market-codes/I1701X |
650 | 2 | 4 |
_aSystems and Data Security. _0https://scigraph.springernature.com/ontologies/product-market-codes/I28060 |
700 | 1 |
_aBrankovic, Ljiljana. _eeditor. _0(orcid)0000-0002-5056-4627 _1https://orcid.org/0000-0002-5056-4627 _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aRyan, Joe. _eeditor. _0(orcid)0000-0002-7781-0306 _1https://orcid.org/0000-0002-7781-0306 _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aSmyth, William F. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783319788241 |
776 | 0 | 8 |
_iPrinted edition: _z9783319788265 |
830 | 0 |
_aTheoretical Computer Science and General Issues ; _v10765 |
|
856 | 4 | 0 |
_zLibro electrónico _uhttp://148.231.10.114:2048/login?url=https://doi.org/10.1007/978-3-319-78825-8 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cLIBRO_ELEC | ||
999 |
_c243093 _d243092 |