東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

WALCOM = algorithms and computation ...

WALCOM (Workshop) (2017 :)

FindBook

Google Book

Amazon

博客來

WALCOM = algorithms and computation : 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29-31, 2017 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	WALCOM/ edited by Sheung-Hung Poon, Md. Saidur Rahman, Hsu-Chun Yen.
其他題名:	algorithms and computation : 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29-31, 2017 : proceedings /
其他題名:	WALCOM 2017
其他作者:	Poon, Sheung-Hung.
團體作者:	WALCOM (Workshop)
出版者:	Cham :Springer International Publishing : : 2017.,
面頁冊數:	xxii, 474 p. :ill., digital ;24 cm.
內容註:	Invited talks -- Computational geometry -- Combinatorial optimization -- Graph drawing -- Graph algorithms -- Space-efficient algorithms -- Computational complexity -- Approximation algorithms.
Contained By:	Springer eBooks
標題:	Computer algorithms - Congresses. -
電子資源:	http://dx.doi.org/10.1007/978-3-319-53925-6
ISBN:	9783319539256

WALCOM = algorithms and computation : 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29-31, 2017 : proceedings /
WALCOMalgorithms and computation : 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29-31, 2017 : proceedings /[electronic resource] :WALCOM 2017edited by Sheung-Hung Poon, Md. Saidur Rahman, Hsu-Chun Yen. - Cham :Springer International Publishing :2017. - xxii, 474 p. :ill., digital ;24 cm. - Lecture notes in computer science,101670302-9743 ;. - Lecture notes in computer science ;10167..

Invited talks -- Computational geometry -- Combinatorial optimization -- Graph drawing -- Graph algorithms -- Space-efficient algorithms -- Computational complexity -- Approximation algorithms.

This book constitutes the proceedings of the 11th International Workshop on Algorithms and Computation, WALCOM 2017, held in Hsinchu, Taiwan, in March 2017. The 35 full papers presented together with three invited talks were carefully reviewed and selected from 83 submissions. The papers are organized in topical sections on invited talks; computational geometry; combinatorial optimization; graph drawing; graph algorithms; space-efficient algorithms; computational complexity; approximation algorithms.

ISBN: 9783319539256

Standard No.: 10.1007/978-3-319-53925-6doiSubjects--Topical Terms:

576357
Computer algorithms
--Congresses.

LC Class. No.: QA76.9.A43 / W35 2017

Dewey Class. No.: 005.1

WALCOM = algorithms and computation : 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29-31, 2017 : proceedings /
LDR:01870nmm a2200337 a 4500 001 2090140
003 DE-He213
005 20170220034659.0
006 m d
007 cr nn 008maaau
008 171013s2017 gw s 0 eng d
020 $a 9783319539256 $q (electronic bk.)
020 $a 9783319539249 $q (paper)
024 7 $a 10.1007/978-3-319-53925-6 $2 doi
035 $a 978-3-319-53925-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43 $b W35 2017
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b W156 2017
111 2 $a WALCOM (Workshop) $n (11th : $d 2017 : $c Hsinchu, Taiwan) $3 3221393
245 1 0 $a WALCOM $h [electronic resource] : $b algorithms and computation : 11th International Conference and Workshops, WALCOM 2017, Hsinchu, Taiwan, March 29-31, 2017 : proceedings / $c edited by Sheung-Hung Poon, Md. Saidur Rahman, Hsu-Chun Yen.
246 3 $a WALCOM 2017
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2017.
300 $a xxii, 474 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 10167
505 0 $a Invited talks -- Computational geometry -- Combinatorial optimization -- Graph drawing -- Graph algorithms -- Space-efficient algorithms -- Computational complexity -- Approximation algorithms.
520 $a This book constitutes the proceedings of the 11th International Workshop on Algorithms and Computation, WALCOM 2017, held in Hsinchu, Taiwan, in March 2017. The 35 full papers presented together with three invited talks were carefully reviewed and selected from 83 submissions. The papers are organized in topical sections on invited talks; computational geometry; combinatorial optimization; graph drawing; graph algorithms; space-efficient algorithms; computational complexity; approximation algorithms.
650 0 $a Computer algorithms $x Congresses. $3 576357
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 891007
700 1 $a Poon, Sheung-Hung. $3 1934978
700 1 $a Rahman, Md. Saidur. $3 901033
700 1 $a Yen, Hsu-Chun. $3 1619795
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 10167. $3 3221394
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-53925-6
950 $a Computer Science (Springer-11645)