000 | 03466nam a22006855i 4500 | ||
---|---|---|---|
001 | 978-3-319-78825-8 | ||
003 | DE-He213 | ||
005 | 20240423125314.0 | ||
007 | cr nn 008mamaa | ||
008 | 180416s2018 sz | s |||| 0|eng d | ||
020 |
_a9783319788258 _9978-3-319-78825-8 |
||
024 | 7 |
_a10.1007/978-3-319-78825-8 _2doi |
|
050 | 4 | _aQA76.9.M35 | |
050 | 4 | _aQA297.4 | |
072 | 7 |
_aUYAM _2bicssc |
|
072 | 7 |
_aPBD _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYAM _2thema |
|
072 | 7 |
_aPBD _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, _x2512-2029 ; _v10765 |
|
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. | ||
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 0 | _aAlgorithms. | |
650 | 0 |
_aArtificial intelligence _xData processing. |
|
650 | 0 | _aArtificial intelligence. | |
650 | 0 | _aNumerical analysis. | |
650 | 0 | _aData protection. | |
650 | 1 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aData Science. |
650 | 2 | 4 | _aArtificial Intelligence. |
650 | 2 | 4 | _aNumerical Analysis. |
650 | 2 | 4 | _aData and Information Security. |
700 | 1 |
_aBrankovic, Ljiljana. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aRyan, Joe. _eeditor. _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, _x2512-2029 ; _v10765 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-319-78825-8 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c176499 _d176499 |