國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Combinatorial algorithms28th Interna...

(1998 :)

Combinatorial algorithms28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017 : revised selected papers /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Combinatorial algorithmsedited by Ljiljana Brankovic, Joe Ryan, William F. Smyth.
其他題名:	28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017 : revised selected papers /
其他題名:	IWOCA 2017
其他作者:	Brankovic, Ljiljana.
團體作者:
出版者:	Cham :Springer International Publishing :2018.
面頁冊數:	xii, 434 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Combinatorial analysisCongresses.
電子資源:	http://dx.doi.org/10.1007/978-3-319-78825-8
ISBN:	9783319788258$q(electronic bk.)

Combinatorial algorithms28th 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] :IWOCA 2017edited by Ljiljana Brankovic, Joe Ryan, William F. Smyth. - Cham :Springer International Publishing :2018. - xii, 434 p. :ill., digital ;24 cm. - Lecture notes in computer science,107650302-9743 ;. - Lecture notes in computer science ;4891..

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$q(electronic bk.)

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

384513
Combinatorial analysis
--Congresses.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 511.6

Combinatorial algorithms28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017 : revised selected papers /
LDR:02115nmm a2200361 a 4500 001 537686
003 DE-He213
005 20180416210223.0
006 m d
007 cr nn 008maaau
008 190116s2018 gw s 0 eng d
020 $a 9783319788258$q(electronic bk.)
020 $a 9783319788241$q(paper)
024 7 $a 10.1007/978-3-319-78825-8 $2 doi
035 $a 978-3-319-78825-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.M35
072 7 $a PBD $2 bicssc
072 7 $a UYAM $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a MAT008000 $2 bisacsh
082 0 4 $a 511.6 $2 23
090 $a QA76.9.M35 $b I61 2017
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
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.
246 3 $a IWOCA 2017
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a xii, 434 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $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 Combinatorial analysis $v Congresses. $3 384513
650 0 $a Computer algorithms $v Congresses. $3 380777
650 1 4 $a Computer Science. $3 212513
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 273702
650 2 4 $a Data Structures. $3 273992
650 2 4 $a Artificial Intelligence (incl. Robotics) $3 252959
650 2 4 $a Numeric Computing. $3 275524
650 2 4 $a Systems and Data Security. $3 274481
700 1 $a Brankovic, Ljiljana. $3 814725
700 1 $a Ryan, Joe. $3 814726
700 1 $a Smyth, William F. $3 511489
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-78825-8
950 $a Computer Science (Springer-11645)