國立虎尾科技大學 |

WALCOM: Algorithms and Computation = 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	WALCOM: Algorithms and Computation/ edited by Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy.
其他題名:	15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings /
其他作者:	Nandy, Subhas C.
面頁冊數:	XV, 334 p. 108 illus., 55 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Information Systems Applications (incl. Internet). -
電子資源:	https://doi.org/10.1007/978-3-030-68211-8
ISBN:	9783030682118

WALCOM: Algorithms and Computation = 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings /
WALCOM: Algorithms and Computation15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings /[electronic resource] :edited by Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy. - 1st ed. 2021. - XV, 334 p. 108 illus., 55 illus. in color.online resource. - Theoretical Computer Science and General Issues ;12635. - Theoretical Computer Science and General Issues ;9163.

Invited talks -- Majority Spanning Trees, Cotrees and Their Applications -- New Transportation Problem on a Graph with Sending and Bringing-Back Operations -- Long papers -- Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees -- On Short Fastest Paths in Temporal Graphs -- Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights -- The Bike Sharing Problem -- Efficient Generation of a Card-based Uniformly Distributed Random Derangement -- Compact Data Structures for Dedekind Groups and Finite Rings -- Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game -- Faster Multi-Sided Boundary Labelling -- On the Geometric Red-Blue Set Cover Problem -- Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes -- $r$-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes -- An Improvement of Reed's Treewidth Approximation -- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs -- Overall and delay complexity of the CLIQUESand Bron-Kerbosch algorithms -- Computing $L(p,1)$-Labeling with Combined Parameters -- On Compatible Matchings -- Upward Point Set Embeddings of Paths and Trees -- 2-colored Point-set Embeddings of Partial 2-trees -- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs -- APX-Hardness and Approximation for the $k$-Burning Number Problem -- Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs -- Physical Zero-Knowledge Proof for Ripple Effect -- Cyclic Shift Problems on Graphs -- Mathematical Characterizations and Computational Complexity of Anti-Slide Puzzles.

This book constitutes the proceedings of the 15th International Conference on Algorithms and Computation, WALCOM 2021, which was planned to take place in Yangon, Myanmar in February/March 2021. The conference changed to an online format due to the COVID-19 pandemic. The 24 full papers included in this volume were carefully reviewed and selected from a total of 60 submissions. They cover diverse areas of algorithms and computation, such as approximation algorithms, algorithmic graph theory and combinatorics, combinatorial algorithms, combinatorial optimization, computational biology, computational complexity, computational geometry, discrete geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, parameterized algorithms, parameterized complexity, network optimization, online algorithms, randomized algorithms, and string algorithms. .

ISBN: 9783030682118

Standard No.: 10.1007/978-3-030-68211-8doiSubjects--Topical Terms:

881699
Information Systems Applications (incl. Internet).

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

WALCOM: Algorithms and Computation = 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings /
LDR:04296nam a22004335i 4500 001 1053339
003 DE-He213
005 20210826131444.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030682118 $9 978-3-030-68211-8
024 7 $a 10.1007/978-3-030-68211-8 $2 doi
035 $a 978-3-030-68211-8
050 4 $a QA75.5-76.95
050 4 $a QA76.63
072 7 $a UY $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UY $2 thema
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
245 1 0 $a WALCOM: Algorithms and Computation $h [electronic resource] : $b 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings / $c edited by Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XV, 334 p. 108 illus., 55 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 12635
505 0 $a Invited talks -- Majority Spanning Trees, Cotrees and Their Applications -- New Transportation Problem on a Graph with Sending and Bringing-Back Operations -- Long papers -- Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees -- On Short Fastest Paths in Temporal Graphs -- Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights -- The Bike Sharing Problem -- Efficient Generation of a Card-based Uniformly Distributed Random Derangement -- Compact Data Structures for Dedekind Groups and Finite Rings -- Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game -- Faster Multi-Sided Boundary Labelling -- On the Geometric Red-Blue Set Cover Problem -- Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes -- $r$-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes -- An Improvement of Reed's Treewidth Approximation -- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs -- Overall and delay complexity of the CLIQUESand Bron-Kerbosch algorithms -- Computing $L(p,1)$-Labeling with Combined Parameters -- On Compatible Matchings -- Upward Point Set Embeddings of Paths and Trees -- 2-colored Point-set Embeddings of Partial 2-trees -- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs -- APX-Hardness and Approximation for the $k$-Burning Number Problem -- Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs -- Physical Zero-Knowledge Proof for Ripple Effect -- Cyclic Shift Problems on Graphs -- Mathematical Characterizations and Computational Complexity of Anti-Slide Puzzles.
520 $a This book constitutes the proceedings of the 15th International Conference on Algorithms and Computation, WALCOM 2021, which was planned to take place in Yangon, Myanmar in February/March 2021. The conference changed to an online format due to the COVID-19 pandemic. The 24 full papers included in this volume were carefully reviewed and selected from a total of 60 submissions. They cover diverse areas of algorithms and computation, such as approximation algorithms, algorithmic graph theory and combinatorics, combinatorial algorithms, combinatorial optimization, computational biology, computational complexity, computational geometry, discrete geometry, data structures, experimental algorithm methodologies, graph algorithms, graph drawing, parallel and distributed algorithms, parameterized algorithms, parameterized complexity, network optimization, online algorithms, randomized algorithms, and string algorithms. .
650 2 4 $a Information Systems Applications (incl. Internet). $3 881699
650 2 4 $a Computer Graphics. $3 669895
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Data Structures. $3 669824
650 1 4 $a Theory of Computation. $3 669322
650 0 $a Application software. $3 528147
650 0 $a Computer graphics. $3 561602
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Computers. $3 565115
700 1 $a Nandy, Subhas C. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1358186
700 1 $a Hong, Seok-Hee. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 678708
700 1 $a Uehara, Ryuhei. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 897136
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030682101
776 0 8 $i Printed edition: $z 9783030682125
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-68211-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)