國立虎尾科技大學 |

Combinatorial Algorithms = 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Combinatorial Algorithms/ edited by Ljiljana Brankovic, Joe Ryan, William F. Smyth.
Reminder of title:	28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers /
other author:	Brankovic, Ljiljana.
Description:	XII, 434 p. 80 illus.online resource. :
Contained By:	Springer Nature eBook
Subject:	Computer science—Mathematics. -
Online resource:	https://doi.org/10.1007/978-3-319-78825-8
ISBN:	9783319788258

Combinatorial Algorithms = 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers /
Combinatorial Algorithms28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers /[electronic resource] :edited by Ljiljana Brankovic, Joe Ryan, William F. Smyth. - 1st ed. 2018. - XII, 434 p. 80 illus.online resource. - Theoretical Computer Science and General Issues ;10765. - Theoretical Computer Science and General Issues ;9163.

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.

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.

ISBN: 9783319788258

Standard No.: 10.1007/978-3-319-78825-8doiSubjects--Topical Terms:

1253519
Computer science—Mathematics.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Combinatorial Algorithms = 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers /
LDR:02430nam a22004215i 4500 001 991923
003 DE-He213
005 20200701183509.0
007 cr nn 008mamaa
008 201225s2018 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
035 $a 978-3-319-78825-8
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. $3 1253519
650 0 $a Algorithms. $3 527865
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Artificial intelligence. $3 559380
650 0 $a Numerical analysis. $3 527939
650 0 $a Computer security. $3 557122
650 1 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Numeric Computing. $3 669943
650 2 4 $a Systems and Data Security. $3 677062
700 1 $a Brankovic, Ljiljana. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1203538
700 1 $a Ryan, Joe. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1203539
700 1 $a Smyth, William F. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 785120
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
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 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-319-78825-8
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)