國立虎尾科技大學 |

Frontiers in Algorithmics = 13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Frontiers in Algorithmics/ edited by Yijia Chen, Xiaotie Deng, Mei Lu.
其他題名:	13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings /
其他作者:	Chen, Yijia.
面頁冊數:	X, 183 p. 83 illus., 19 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Algorithms. -
電子資源:	https://doi.org/10.1007/978-3-030-18126-0
ISBN:	9783030181260

Frontiers in Algorithmics = 13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings /
Frontiers in Algorithmics13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings /[electronic resource] :edited by Yijia Chen, Xiaotie Deng, Mei Lu. - 1st ed. 2019. - X, 183 p. 83 illus., 19 illus. in color.online resource. - Theoretical Computer Science and General Issues ;11458. - Theoretical Computer Science and General Issues ;9163.

A Polynomial Time Algorithm for Fair Resource Allocation in Resource Exchange -- A Local Search 4=3-Approximation Algorithm for the Minimum 3-Path Partition Problem -- Efficient Guarding of Polygons and Terrains -- Graph Orientation with Edge Modifications -- Local Coloring: New Observations and New Reductions -- Secure Computation of Any Boolean Function Based on Any Deck of Cards -- A Novel Business Model for Electric Car Sharing -- Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes- Read-Once Resolutions in Horn Formulas -- Vertex-Critical (P5 ,banner)-Free Graphs -- An FPTAS for Stochastic Unbounded Min-Knapsack Problem -- The Inapproximability of k-DominatingSet for Parameterized AC0 Circuits -- Mutual Visibility by Robots with Persistent Memory -- Pushing the Online Matrix-vector Conjecture Off-line and Identifying Its Easy Cases -- An Improved Approximation Algorithm for the k-Means Problem with Penalties. .

This book constitutes the proceedings of the 13th International Workshop on Frontiers in Algorithmics, FAW 2019, held in Sanya, China, in April/May 2019. The 15 full papers presented in this volume were carefully reviewed and selected from 21 submissions. The workshop provides a focused forum on current trends of research on algorithms, discrete structures, and their applications, and brings together international experts at the research frontiers in these areas to exchange ideas and to present significant new results.

ISBN: 9783030181260

Standard No.: 10.1007/978-3-030-18126-0doiSubjects--Topical Terms:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Frontiers in Algorithmics = 13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings /
LDR:02965nam a22004095i 4500 001 1007288
003 DE-He213
005 20200701105338.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030181260 $9 978-3-030-18126-0
024 7 $a 10.1007/978-3-030-18126-0 $2 doi
035 $a 978-3-030-18126-0
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
245 1 0 $a Frontiers in Algorithmics $h [electronic resource] : $b 13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings / $c edited by Yijia Chen, Xiaotie Deng, Mei Lu.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a X, 183 p. 83 illus., 19 illus. in color. $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 11458
505 0 $a A Polynomial Time Algorithm for Fair Resource Allocation in Resource Exchange -- A Local Search 4=3-Approximation Algorithm for the Minimum 3-Path Partition Problem -- Efficient Guarding of Polygons and Terrains -- Graph Orientation with Edge Modifications -- Local Coloring: New Observations and New Reductions -- Secure Computation of Any Boolean Function Based on Any Deck of Cards -- A Novel Business Model for Electric Car Sharing -- Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes- Read-Once Resolutions in Horn Formulas -- Vertex-Critical (P5 ,banner)-Free Graphs -- An FPTAS for Stochastic Unbounded Min-Knapsack Problem -- The Inapproximability of k-DominatingSet for Parameterized AC0 Circuits -- Mutual Visibility by Robots with Persistent Memory -- Pushing the Online Matrix-vector Conjecture Off-line and Identifying Its Easy Cases -- An Improved Approximation Algorithm for the k-Means Problem with Penalties. .
520 $a This book constitutes the proceedings of the 13th International Workshop on Frontiers in Algorithmics, FAW 2019, held in Sanya, China, in April/May 2019. The 15 full papers presented in this volume were carefully reviewed and selected from 21 submissions. The workshop provides a focused forum on current trends of research on algorithms, discrete structures, and their applications, and brings together international experts at the research frontiers in these areas to exchange ideas and to present significant new results.
650 0 $a Algorithms. $3 527865
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Numerical analysis. $3 527939
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Computer communication systems. $3 1115394
650 0 $a Artificial intelligence. $3 559380
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Numeric Computing. $3 669943
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Computer Communication Networks. $3 669310
650 2 4 $a Artificial Intelligence. $3 646849
700 1 $a Chen, Yijia. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1301033
700 1 $a Deng, Xiaotie. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 676036
700 1 $a Lu, Mei. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1301034
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030181253
776 0 8 $i Printed edition: $z 9783030181277
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-18126-0
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)