|
|
|
|
| LEADER |
03829nam a2200613 4500 |
| 001 |
978-3-319-78825-8 |
| 003 |
DE-He213 |
| 005 |
20191027042555.0 |
| 007 |
cr nn 008mamaa |
| 008 |
180416s2018 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783319788258
|9 978-3-319-78825-8
|
| 024 |
7 |
|
|a 10.1007/978-3-319-78825-8
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.9.M35
|
| 072 |
|
7 |
|a PBD
|2 bicssc
|
| 072 |
|
7 |
|a COM018000
|2 bisacsh
|
| 072 |
|
7 |
|a PBD
|2 thema
|
| 072 |
|
7 |
|a UYAM
|2 thema
|
| 082 |
0 |
4 |
|a 004.0151
|2 23
|
| 245 |
1 |
0 |
|a Combinatorial Algorithms
|h [electronic resource] :
|b 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers /
|c edited by Ljiljana Brankovic, Joe Ryan, William F. Smyth.
|
| 250 |
|
|
|a 1st ed. 2018.
|
| 264 |
|
1 |
|a Cham :
|b Springer International Publishing :
|b Imprint: Springer,
|c 2018.
|
| 300 |
|
|
|a XII, 434 p. 80 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 10765
|
| 505 |
0 |
|
|a Approximation 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 |
|
|
|a This 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 |
|a Computer science-Mathematics.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Data structures (Computer science).
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
|
0 |
|a Numerical analysis.
|
| 650 |
|
0 |
|a Computer security.
|
| 650 |
1 |
4 |
|a Discrete Mathematics in Computer Science.
|0 http://scigraph.springernature.com/things/product-market-codes/I17028
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|0 http://scigraph.springernature.com/things/product-market-codes/I16021
|
| 650 |
2 |
4 |
|a Data Structures.
|0 http://scigraph.springernature.com/things/product-market-codes/I15017
|
| 650 |
2 |
4 |
|a Artificial Intelligence.
|0 http://scigraph.springernature.com/things/product-market-codes/I21000
|
| 650 |
2 |
4 |
|a Numeric Computing.
|0 http://scigraph.springernature.com/things/product-market-codes/I1701X
|
| 650 |
2 |
4 |
|a Systems and Data Security.
|0 http://scigraph.springernature.com/things/product-market-codes/I28060
|
| 700 |
1 |
|
|a Brankovic, Ljiljana.
|e editor.
|0 (orcid)0000-0002-5056-4627
|1 https://orcid.org/0000-0002-5056-4627
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Ryan, Joe.
|e editor.
|0 (orcid)0000-0002-7781-0306
|1 https://orcid.org/0000-0002-7781-0306
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Smyth, William F.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783319788241
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783319788265
|
| 830 |
|
0 |
|a Theoretical Computer Science and General Issues ;
|v 10765
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-319-78825-8
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
