國立虎尾科技大學 |

Computing and Combinatorics = 27th International Conference, COCOON 2021, Tainan, Taiwan, October 24–26, 2021, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Computing and Combinatorics/ edited by Chi-Yeh Chen, Wing-Kai Hon, Ling-Ju Hung, Chia-Wei Lee.
其他題名:	27th International Conference, COCOON 2021, Tainan, Taiwan, October 24–26, 2021, Proceedings /
其他作者:	Lee, Chia-Wei.
面頁冊數:	XXI, 694 p. 173 illus., 67 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Mathematics of Computing. -
電子資源:	https://doi.org/10.1007/978-3-030-89543-3
ISBN:	9783030895433

Computing and Combinatorics = 27th International Conference, COCOON 2021, Tainan, Taiwan, October 24–26, 2021, Proceedings /
Computing and Combinatorics27th International Conference, COCOON 2021, Tainan, Taiwan, October 24–26, 2021, Proceedings /[electronic resource] :edited by Chi-Yeh Chen, Wing-Kai Hon, Ling-Ju Hung, Chia-Wei Lee. - 1st ed. 2021. - XXI, 694 p. 173 illus., 67 illus. in color.online resource. - Theoretical Computer Science and General Issues,130252512-2029 ;. - Theoretical Computer Science and General Issues,12865.

Algorithms -- Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator against Permutation Branching Programs -- All-to-All Broadcast in Dragonfly Networks -- An Efficient Algorithm for Enumerating Longest Common Increasing Subsequences -- On Singleton Congestion Games with Resilience Against Collusion -- A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph -- Approximation Algorithms -- General Max-Min Fair Allocation -- On the approximation hardness of geodetic set and its variants -- Approximate Distance Oracles with Improved Stretch for Sparse Graphs -- Hardness and Approximation Results of Roman \{3\}-Domination in Graphs -- Approximation algorithms for priority Steiner tree problems -- Sublinear-Space Approximation Algorithms for Max r-SAT -- A Further Improvement on Approximating TTP-2 -- Automata -- Sequence graphs realizations and ambiguity in language models -- Between SC and LOGDCFL: Families of Languages Accepted by Polynomial-Time Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata -- Ideal Separation and General Theorems for Constrained Synchronization and their Application to Small Constraint Automata -- Most Pseudo-copy Languages Are Not Context-free -- Computational Geometry -- Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set -- Deterministic metric 1-median selection with a 1 - o(1) fraction of points ignored -- The Coverage problem by Aligned Disks -- Consistent Simplification of Polyline Tree Bundles -- Improving Upper and Lower Bounds for the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs -- Minimum Color Spanning Circle in Imprecise Setup -- Fault Tolerant Computing and Fault Diagnosis -- Reliability Evaluation of Subsystem Based on Exchanged Hypercube -- Fault diagnosability of regular networks under the Hybrid PMC model -- A Study for Conditional Diagnosability of Pancake Graphs -- A new measure for locally t-diagnosable under PMC model -- Graph Algorithms -- Colouring graphs with no induced six-vertex path or diamond -- Constructing Tri-CISTs in Shu e-Cubes -- Reconfiguring Directed Trees in a Digraph -- Decremental Optimization of Vertex-Coloring Under the Reconfiguration Framework -- Embedding Three Edge-disjoint Hamiltonian Cycles into Locally Twisted Cubes -- On the Probe Problem for (r,l)-Well-Coveredness -- Distinguishing graphs via cycles -- Graph Theory and Applications -- The Restrained Domination and Independent Restrained Domination in Extending Supergrid Graphs -- The Concentration of the Maximum Degree in the Duplication-Divergence Models -- Conditional Fractional Matching Preclusion for Burnt Pancake Graphs and Pancake-Like Graphs -- The Weakly Dimension-balanced Pancyclicity on Toroidal Mesh Graph Tm,n when Both m and n Are Odd -- Hypercontractivity via Tensor Calculus -- Network and Algorithms -- Respecting Lower Bounds in Uniform Lower and Upper Bounded Facility Location Problem -- Finding Cheapest Deadline Paths -- Approximate the Lower-Bounded Connected Facility Location Problem -- Mechanism Design for Facility Location with Fractional Preferences and Minimum Distance -- Online Algorithm and Streaming Algorithms -- On the Hardness of Opinion Dynamics Optimization with L1-Budget on Varying Susceptibility to Persuasion -- Symmetric Norm Estimation and Regression on Sliding Windows -- Single-Pass Streaming Algorithms to Partition Graphs into Few Forests -- The Secretary Problem with Reservation Costs -- Online Ride-Hitching in UAV Travelling -- Parameterized Complexity and Algorithms Disconnected Matchings -- On the d-Claw Vertex Deletion Problem -- Constrained Hitting Set Problem with Intervals -- Exact algorithms for maximum weighted independent set on sparse graphs -- Recreational Games -- Two Standard Decks of Playing Cards are Sufficient for a ZKP for Sudoku -- Token Shifting on Graphs -- Computational Complexity of Jumping Block Puzzles -- A Card-minimal Three-Input AND Protocol Using Two Shuffles -- Spy game: FPT-algorithm and results on graph products -- .

This book constitutes the proceedings of the 27th International Conference on Computing and Combinatorics, COCOON 2021, held in Tainan, Taiwan, in October 2021. Due to the COVID-19 pandemic, COCOON 2021 was organized as a hybrid conference. The 56 papers presented in this volume were carefully reviewed and selected from 131 submissions. The papers are divided into the following topical sub-headings: algorithms, approximation algorithms, automata, computational geometry, fault tolerant computing and fault diagnosis, graph algorithms, graph theory and applications, network and algorithms, online algorithm and stream algorithms, parameterized complexity and algorithms, and recreational games.

ISBN: 9783030895433

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

669457
Mathematics of Computing.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

Computing and Combinatorics = 27th International Conference, COCOON 2021, Tainan, Taiwan, October 24–26, 2021, Proceedings /
LDR:06292nam a22004095i 4500 001 1059402
003 DE-He213
005 20220223143256.0
007 cr nn 008mamaa
008 220414s2021 sz | s |||| 0|eng d
020 $a 9783030895433 $9 978-3-030-89543-3
024 7 $a 10.1007/978-3-030-89543-3 $2 doi
035 $a 978-3-030-89543-3
050 4 $a QA75.5-76.95
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
245 1 0 $a Computing and Combinatorics $h [electronic resource] : $b 27th International Conference, COCOON 2021, Tainan, Taiwan, October 24–26, 2021, Proceedings / $c edited by Chi-Yeh Chen, Wing-Kai Hon, Ling-Ju Hung, Chia-Wei Lee.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XXI, 694 p. 173 illus., 67 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, $x 2512-2029 ; $v 13025
505 0 $a Algorithms -- Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator against Permutation Branching Programs -- All-to-All Broadcast in Dragonfly Networks -- An Efficient Algorithm for Enumerating Longest Common Increasing Subsequences -- On Singleton Congestion Games with Resilience Against Collusion -- A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph -- Approximation Algorithms -- General Max-Min Fair Allocation -- On the approximation hardness of geodetic set and its variants -- Approximate Distance Oracles with Improved Stretch for Sparse Graphs -- Hardness and Approximation Results of Roman \{3\}-Domination in Graphs -- Approximation algorithms for priority Steiner tree problems -- Sublinear-Space Approximation Algorithms for Max r-SAT -- A Further Improvement on Approximating TTP-2 -- Automata -- Sequence graphs realizations and ambiguity in language models -- Between SC and LOGDCFL: Families of Languages Accepted by Polynomial-Time Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata -- Ideal Separation and General Theorems for Constrained Synchronization and their Application to Small Constraint Automata -- Most Pseudo-copy Languages Are Not Context-free -- Computational Geometry -- Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set -- Deterministic metric 1-median selection with a 1 - o(1) fraction of points ignored -- The Coverage problem by Aligned Disks -- Consistent Simplification of Polyline Tree Bundles -- Improving Upper and Lower Bounds for the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs -- Minimum Color Spanning Circle in Imprecise Setup -- Fault Tolerant Computing and Fault Diagnosis -- Reliability Evaluation of Subsystem Based on Exchanged Hypercube -- Fault diagnosability of regular networks under the Hybrid PMC model -- A Study for Conditional Diagnosability of Pancake Graphs -- A new measure for locally t-diagnosable under PMC model -- Graph Algorithms -- Colouring graphs with no induced six-vertex path or diamond -- Constructing Tri-CISTs in Shu e-Cubes -- Reconfiguring Directed Trees in a Digraph -- Decremental Optimization of Vertex-Coloring Under the Reconfiguration Framework -- Embedding Three Edge-disjoint Hamiltonian Cycles into Locally Twisted Cubes -- On the Probe Problem for (r,l)-Well-Coveredness -- Distinguishing graphs via cycles -- Graph Theory and Applications -- The Restrained Domination and Independent Restrained Domination in Extending Supergrid Graphs -- The Concentration of the Maximum Degree in the Duplication-Divergence Models -- Conditional Fractional Matching Preclusion for Burnt Pancake Graphs and Pancake-Like Graphs -- The Weakly Dimension-balanced Pancyclicity on Toroidal Mesh Graph Tm,n when Both m and n Are Odd -- Hypercontractivity via Tensor Calculus -- Network and Algorithms -- Respecting Lower Bounds in Uniform Lower and Upper Bounded Facility Location Problem -- Finding Cheapest Deadline Paths -- Approximate the Lower-Bounded Connected Facility Location Problem -- Mechanism Design for Facility Location with Fractional Preferences and Minimum Distance -- Online Algorithm and Streaming Algorithms -- On the Hardness of Opinion Dynamics Optimization with L1-Budget on Varying Susceptibility to Persuasion -- Symmetric Norm Estimation and Regression on Sliding Windows -- Single-Pass Streaming Algorithms to Partition Graphs into Few Forests -- The Secretary Problem with Reservation Costs -- Online Ride-Hitching in UAV Travelling -- Parameterized Complexity and Algorithms Disconnected Matchings -- On the d-Claw Vertex Deletion Problem -- Constrained Hitting Set Problem with Intervals -- Exact algorithms for maximum weighted independent set on sparse graphs -- Recreational Games -- Two Standard Decks of Playing Cards are Sufficient for a ZKP for Sudoku -- Token Shifting on Graphs -- Computational Complexity of Jumping Block Puzzles -- A Card-minimal Three-Input AND Protocol Using Two Shuffles -- Spy game: FPT-algorithm and results on graph products -- .
520 $a This book constitutes the proceedings of the 27th International Conference on Computing and Combinatorics, COCOON 2021, held in Tainan, Taiwan, in October 2021. Due to the COVID-19 pandemic, COCOON 2021 was organized as a hybrid conference. The 56 papers presented in this volume were carefully reviewed and selected from 131 submissions. The papers are divided into the following topical sub-headings: algorithms, approximation algorithms, automata, computational geometry, fault tolerant computing and fault diagnosis, graph algorithms, graph theory and applications, network and algorithms, online algorithm and stream algorithms, parameterized complexity and algorithms, and recreational games.
650 2 4 $a Mathematics of Computing. $3 669457
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 1 4 $a Theory of Computation. $3 669322
650 0 $a Algorithms. $3 527865
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Information theory. $3 595305
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Computer science. $3 573171
700 1 $a Lee, Chia-Wei. $e editor. $1 https://orcid.org/0000-0002-5337-0473 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1361852
700 1 $a Hung, Ling-Ju. $e editor. $1 https://orcid.org/0000-0001-5659-5507 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1361851
700 1 $a Hon, Wing-Kai. $e editor. $1 https://orcid.org/0000-0002-0570-2904 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1361850
700 1 $a Chen, Chi-Yeh. $e editor. $1 https://orcid.org/0000-0001-9664-8538 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1361849
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030895426
776 0 8 $i Printed edition: $z 9783030895440
830 0 $a Theoretical Computer Science and General Issues, $x 2512-2029 ; $v 12865 $3 1365719
856 4 0 $u https://doi.org/10.1007/978-3-030-89543-3
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)