Computing and Combinatorics 27th International Conference, COCOON 2021, Tainan, Taiwan, October 24-26, 2021, Proceedings
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 review...
Saved in:
| Main Authors | , , , , |
|---|---|
| Format | eBook Book |
| Language | English |
| Published |
Cham
Springer Nature
2021
Springer Springer International Publishing AG Springer International Publishing |
| Edition | 1 |
| Series | Lecture Notes in Computer Science |
| Subjects | |
| Online Access | Get full text |
| ISBN | 3030895432 9783030895433 3030895424 9783030895426 |
Cover
Table of Contents:
- 3.4 Layers of Addable and Blocking Edges -- 3.5 The Local Search Step -- 3.6 Analysis -- 4 Conclusion -- References -- On the Approximation Hardness of Geodetic Set and Its Variants -- 1 Introduction -- 2 Notations -- 3 Hardness to Find a Geodesic Assignation -- 4 Approximation -- 5 Reduction from Set Cover -- 5.1 On General Case -- 5.2 On Subcubic Bipartite Graphs -- 6 Non-approximability -- 6.1 Strong Geodetic Set and Strong Edge Geodetic Set -- 6.2 Geodetic Set and Edge Geodetic Set -- 7 Strong Geodetic Number on Complete Multipartite Graphs -- 8 Conclusion -- References -- Approximate Distance Oracles with Improved Stretch for Sparse Graphs -- 1 Introduction -- 1.1 Related Work -- 1.2 Paper Organization -- 2 Preliminaries and Previous Work -- 2.1 The Distance Oracle of Thorup and Zwick -- 2.2 A Standard Variant of the Distance Oracle of Thorup and Zwick -- 3 Distance Oracles with Improved Stretch -- 4 A Refined Stretch Analysis of Thorup-Zwick Distance Oracle -- 5 Concluding Remarks -- References -- Hardness and Approximation Results of Roman {3}-Domination in Graphs -- 1 Introduction -- 2 Preliminaries -- 3 NP-completeness Result -- 4 Algorithm for Threshold Graphs -- 5 Approximation Results -- 5.1 Approximation Algorithm -- 5.2 APX-completeness for bounded degree graphs -- 6 Conclusion -- References -- Approximation Algorithms for Priority Steiner Tree Problems -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Results -- 2 Priority Steiner Tree: Two Logarithmic Approximations -- 3 An O(log|T|)-Approximation for Priority NWST -- 3.1 Algorithm Description -- 3.2 Analysis of Algorithm3 -- 4 Conclusions and Future Work -- References -- Sublinear-Space Approximation Algorithms for Max r-SAT -- 1 Introduction -- 2 Preliminaries -- 2.1 Time and Space Overheads -- 2.2 Universal Hash Families -- 3 Max r-SAT
- 4 Algorithm for Directed Tree Reconfiguration
- 1 Introduction -- 2 Preliminaries -- 3 Pseudo-copy Languages -- 4 Complements of Pseudo-copy Languages -- 5 Conclusions -- References -- Computational Geometry -- Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Related Work -- 2 A Polynomial-Time Algorithm for a Fixed k -- 3 NP-Hardness -- 3.1 Covering Points by Straight or Left-Facing Angles -- 3.2 Bottleneck Convex Subsets Is NP-Hard -- 4 Point Sets with Few Points Inside the Convex Hull -- 5 Discussion -- References -- Deterministic Metric 1-median Selection with a 1-o(1) Fraction of Points Ignored -- 1 Introduction -- 2 Main Result -- 3 Conclusions -- References -- The Coverage Problem by Aligned Disks -- 1 Introduction -- 2 Preliminary -- 3 Algorithm 1 -- 4 Algorithm 2 -- 5 Conclusion -- References -- Consistent Simplification of Polyline Tree Bundles -- 1 Introduction -- 2 Preliminaries -- 3 Hardness of Approximating Planar Polyline Bundle Simplification -- 4 Simplification of Polyline Tree Bundles -- 5 Tree Bundle Decompositions -- 6 Experimental Evaluation -- 7 Future Work -- References -- Improving Upper and Lower Bounds for the Total Number of Edge Crossings of Euclidean Minimum Weight Laman Graphs -- 1 Introduction -- 2 Preliminaries -- 3 Improved Upper Bound for (P) -- 3.1 Counting Scheme -- 4 Improved Lower Bound for (P) -- 5 Future Works -- References -- Minimum Color Spanning Circle in Imprecise Setup -- 1 Introduction -- 1.1 Our Contribution -- 2 The Smallest MCSC (S-MCSC) Problem -- 3 The Largest MCSC (L-MCSC) Problem -- 4 Approximation Algorithms -- References -- Fault Tolerant Computing and Fault Diagnosis -- Reliability Evaluation of Subsystem Based on Exchanged Hypercube -- 1 Introduction -- 2 Preliminaries -- 2.1 Notations -- 2.2 Exchanged Hypercube
- Intro -- Preface -- Organization -- Abstracts of Invited Talks -- Coupon Allocation in Social Market: Robust and Machine Learning -- Discrepancy Theory in Combinatorics, Geometry and Computation -- Learning Graphs with Topology Properties -- Bamboo Garden Trimming Problem -- Contents -- Algorithms -- Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator Against Permutation Branching Programs -- 1 Introduction -- 1.1 Pseudorandom Generators for Space-Bounded Computation -- 1.2 Permutation Branching Programs -- 1.3 Our Results -- 1.4 Techniques -- References -- All-to-All Broadcast in Dragonfly Networks -- 1 Introduction -- 2 Preliminaries -- 3 All-to-All Broadcast Using One-to-All Broadcast Schemes -- 4 The Proposed All-to-All Broadcast Algorithm A2A -- 5 Conclusions -- References -- An Efficient Algorithm for Enumerating Longest Common Increasing Subsequences -- 1 Introduction -- 2 The Proposed Algorithm -- 2.1 Assumptions -- 2.2 Algorithm Overview -- 2.3 Detailed Description -- 2.4 Example -- 3 The Analysis -- 3.1 Correctness -- 3.2 Complexity -- 4 Conclusion and Discussion -- References -- On Singleton Congestion Games with Resilience Against Collusion -- 1 Introduction -- 2 The Model and the Preliminaries -- 3 The Main Result -- References -- A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph -- 1 Introduction -- 1.1 New Results -- 2 A Greedy Generation for Tn -- 3 An O(1)-Amortized Time Pivot Gray Code Generation for Tn -- 3.1 Ranking and Unranking -- 4 Conclusion -- References -- Approximation Algorithms -- General Max-Min Fair Allocation -- 1 Introduction -- 2 Every Resource Has a Positive Utility for Every Player -- 3 Some Resources Have Zero Utility for Some Players -- 3.1 Resources and Over-Estimation -- 3.2 Fat Edges and Thin Edges -- 3.3 Overview of the Algorithm
- 3.1 Factor-((5 - 1) / 2) Approximation Algorithm -- 3.2 Factor-(2 / 2) Approximation Algorithm -- 4 Planar Max r-SAT -- References -- A Further Improvement on Approximating TTP-2 -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Results -- 2 Preliminaries -- 2.1 Independent Lower Bound and Extra Cost -- 3 Constructing the Schedule -- 4 Approximation Quality of the Schedule -- 5 Experimental Results -- 5.1 Heuristics Based on Local Search -- 5.2 Applications to Benchmark Sets -- 6 Conclusion -- References -- Automata -- Sequence Graphs Realizations and Ambiguity in Language Models -- 1 Introduction -- 2 Definitions and Problem Statement -- 3 Theoretical Results -- 3.1 A Complete Characterization of 2-sequence Graphs -- 3.2 General Sequence Graphs and Realizablew3 -- 4 Effective General Algorithms -- 4.1 Realizablew: Linear Integer Programming Formulation -- 4.2 NumRealizationsw: Dynamic Programming Formulation -- 5 Conclusion -- References -- Between SC and LOGDCFL: Families of Languages Accepted by Polynomial-Time Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata -- 1 DCFL, LOGDCFL, and Beyond -- 2 Storage Tapes and Storage Automata -- 3 A Complexity Upper Bound of kSDA -- 4 Two Machine Models that Characterize LOGkSDA -- 4.1 Deterministic Auxiliary Depth-k Storage Automata -- 4.2 Multi-head Deterministic Depth-k Storage Automata -- 4.3 Characterizations of LOGkSDA -- References -- Ideal Separation and General Theorems for Constrained Synchronization and Their Application to Small Constraint Automata -- 1 Introduction -- 2 General Notions and Definitions -- 3 Known Results on Constrained Synchronization -- 4 General Results -- 5 Application to Small Constraint Automata -- 5.1 Two States and Arbitrary Alphabet -- 5.2 Three States and Arbitrary Alphabet -- 6 Conclusion -- References -- Most Pseudo-copy Languages Are Not Context-Free
- 2.3 Subsystem Reliability Under the Probability Fault Model -- 3 Approximate Value of Rs-1,t-1s,t(p) -- 4 Upper Bound of Rs-1,t-1s,t(p) -- 5 Comparative Analysis and Discussion -- References -- Fault Diagnosability of Regular Networks Under the Hybrid PMC Model -- 1 Introduction -- 2 Preliminaries -- 3 Fault Diagnosability of Regular Networks Under the HPMC Model -- 3.1 h-Restricted Vertex Diagnosability of Networks -- 3.2 r-Restricted Edge Diagnosability of Networks -- 4 Applications to Regular Networks -- 4.1 The Hypercube-Like Networks HLn -- 4.2 The DQcube DQ(m, d, n) -- 4.3 The Exchanged Hypercube EH(s, t) -- 4.4 The Half Hypercube Network HHn -- 5 Conclusions -- References -- A Study for Conditional Diagnosability of Pancake Graphs -- 1 Introduction -- 2 Preliminaries -- 3 Properties of Pancake Graphs -- 4 Conditional Diagnosability of Pancake Graphs -- 5 Conclusion -- References -- A New Measure for Locally t-Diagnosable Under PMC Model -- 1 Introduction -- 2 Preliminaries -- 3 Local Diagnosis Algorithm -- 4 Local Diagnosis of Incomplete Hypercube -- References -- Graph Algorithms -- Colouring Graphs with No Induced Six-Vertex Path or Diamond -- 1 Introduction -- 2 Preliminaries -- 3 The Structure of Imperfect (P6, diamond)-Free Graphs -- 4 The -Bound of (P6, diamond)-Free Graphs -- 5 Computing the Chromatic Number of (P6, diamond)-Free Graphs in Polynomial Time -- 6 Conclusion -- References -- Constructing Tri-CISTs in Shuffle-Cubes -- 1 Introduction -- 2 Preliminary -- 3 Constructing Tri-CISTs in Shuffle-Cubes -- 3.1 A Tri-CIST of SQ6 -- 3.2 A Recursive Construction of a Tri-CIST in High-Dimensional SQn -- 4 Concluding Remarks -- References -- Reconfiguring Directed Trees in a Digraph -- 1 Introduction -- 2 Preliminaries -- 3 Always Reconfigurable Cases -- 3.1 Directed Forests -- 3.2 Directed Forests with Fixed Roots