Computing and Combinatorics 24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings

This book constitutes the proceedings of the 24th International Conference on Computing and Combinatorics, COCOON 2018, held in Qing Dao, China, in July 2018. The 62 papers presented in this volume were carefully reviewed and selected from 120 submissions. They deal with the areas of algorithms, the...

Full description

Saved in:
Bibliographic Details
Main Authors Wang, Lusheng, Zhu, Daming
Format eBook Book
LanguageEnglish
Published Cham Springer Nature 2018
Springer
Springer International Publishing AG
Edition1
SeriesLNCS sublibrary. SL 1, Theoretical computer science and general issues
Subjects
Combinatorial analysis > Data processing > Congresses
Computer programming, programs, data
Computer science > Mathematics > Congresses
Online AccessGet full text
ISBN9783319947761
3319947761
9783319947754
3319947753

Cover

Table of Contents:
  • Intro -- Preface -- Organization -- Abstracts of Invited Talks -- Privacy Aspects in Data Querying -- Challenges from Cancer Immunotherapy -- Reconstructing Tumor Evolution and Progression in Structurally Variant Cancer Cells -- Contents -- Constructing Independent Spanning Trees on Bubble-Sort Networks -- 1 Introduction -- 2 Preliminaries -- 3 Constructing ISTs on Bn -- 4 Correctness -- 5 Concluding Remarks -- References -- Exact Algorithms for Finding Partial Edge-Disjoint Paths -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Results -- 2 An Exact Algorithm to the 2PESP problem -- 3 Exact Algorithms for kPESP in DAGs -- 3.1 An Exact Algorithm for 2PESP -- 3.2 Extension to kPESP for k3 in DAGs -- 4 Conclusion -- References -- A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications -- 1 Introduction -- 2 Preliminaries -- 2.1 Breakpoint Graph of Signed and Unsigned Genomes -- 2.2 The Signed DCJ Distance Formula -- 2.3 The UDCJ Problem -- 2.4 Converting Unsigned Genomes into Signed Ones -- 3 An FPT-time Approximation Algorithm -- 3.1 General Sketch -- 3.2 Finding 2-Cycles -- 3.3 Finding 2,3-Cycles -- 4 Performance Analysis -- 4.1 The Approximation Factor -- 4.2 The Time Complexity -- 5 Concluding Remarks -- References -- Contextual Dependent Click Bandit Algorithm for Web Recommendation -- 1 Introduction -- 2 Problem Formulation -- 3 Algorithm and Results -- 3.1 Algorithm -- 3.2 Results -- 3.3 Computationally Efficient Updates -- 4 Experiments -- 4.1 Synthetic Data -- 4.2 Web Page Recommendation -- 5 Conclusion -- References -- LP-Based Pivoting Algorithm for Higher-Order Correlation Clustering -- 1 Introduction -- 2 Related Work -- 3 Preliminaries -- 3.1 Notations -- 3.2 Reduction to the Graph Correlation Clustering -- 3.3 Overview of Our Algorithms -- 4 O(klogn)-Approximation for General Hypergraphs
  • 3 Hardness Under Restricted Settings -- 4 Efficient Approximation of Minimum Coverage Kernels -- 5 Discussion -- References -- Weak Mitoticity of Bounded Disjunctive and Conjunctive Truth-Table Autoreducible Sets -- 1 Introduction -- 2 Definitions and Notations -- 3 Results -- References -- Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph -- 1 Introduction -- 2 Approximating F2 G = (V, E), pij = 1 Cmax -- 2.1 Path Cover with the Minimum Number of 0-Paths -- 2.2 Path Cover with the Minimum Number of {0, 1}-Paths -- 2.3 Approximation Algorithms for F2 G = (V, E), pij = 1 Cmax -- 3 Approximating F2 G = KKn-, pij Cmax -- 4 Concluding Remarks -- References -- On Contact Representations of Directed Planar Graphs -- 1 Introduction -- 2 Preliminaries -- 3 Point-Side Contact Representations of Outerplanar Digraphs -- 4 A Linear-Time Procedure for Constructing psTCRs of Maximal Outerplanar Diagraphs -- 5 Contact Representations of Planar Digraphs Using n-gons -- References -- Computation and Growth of Road Network Dimensions -- 1 Introduction -- 1.1 Related Work -- 1.2 Contributions -- 2 Preliminaries -- 2.1 Road Network Dimensions -- 2.2 Contraction Hierarchies -- 2.3 Transit Node Routing -- 3 Skeleton Dimension and Pathwidth -- 4 Lower Bounds for the Highway Dimension -- 5 Skeleton Dimension Computation -- 5.1 Computing the Width of a Tree -- 5.2 Naive Algorithm -- 5.3 Faster Processing with PHAST -- 5.4 Upper Bounds -- 5.5 Exploiting Transit Nodes -- 5.6 Pruning -- 5.7 Computing Exact Values -- 6 Experiments -- 7 Conclusions and Future Work -- References -- Car-Sharing Between Two Locations: Online Scheduling with Flexible Advance Bookings -- 1 Introduction -- 1.1 Related Work -- 1.2 Problem Description and Preliminaries -- 1.3 Paper Outline -- 2 Car Sharing with Fixed Booking Times
  • 3 Car Sharing with Variable Booking Times -- 4 Conclusion -- References -- Directed Path-Width and Directed Tree-Width of Directed Co-graphs -- 1 Introduction -- 2 Preliminaries -- 3 Directed Path-Width of Directed Co-graphs -- 4 Directed Tree-Width of Directed Co-graphs -- 5 Directed Tree-Width and Directed Path-Width -- 6 Conclusion and Outlook -- References -- Generalized Graph k-Coloring Games -- 1 Introduction -- 2 Preliminaries -- 3 Existence of Nash Equilibria -- 4 Utilitarian Social Welfare -- 4.1 Price of Anarchy -- 4.2 Price of Stability -- 5 Egalitarian Social Welfare -- 5.1 Price of Anarchy -- 5.2 Price of Stability -- 6 Future Work -- References -- On Colorful Bin Packing Games -- 1 Introduction -- 2 Model and Preliminaries -- 3 Existence and Efficiency of Nash Equilibria in General Games -- 4 Efficiency of Nash Equilibria in Black and White Games -- 5 Efficiency of Nash Equilibria in Games with Uniform Sizes -- References -- Nonbipartite Dulmage-Mendelsohn Decomposition for Berge Duality -- 1 Introduction -- 2 Basic Preliminaries -- 2.1 General Definitions -- 2.2 Barriers, Gallai-Edmonds Family, and Factor-Components -- 3 Basilica Decomposition of Graphs -- 4 Poset with Transitive Forbidden Relation -- 5 DM Decomposition for General Graphs -- 6 Characterization of Maximal Barriers -- 7 Original DM Decomposition for Bipartite Graphs -- References -- The Path Set Packing Problem -- 1 Introduction -- 2 Basic Notations and Related Work -- 3 Hardness -- 4 The Case of Trees -- 5 A Parameterized Algorithm -- 6 Conclusion -- References -- Manipulation Strategies for the Rank-Maximal Matching Problem -- 1 Introduction -- 2 Background -- 2.1 Rank-Maximal Matchings -- 3 Properties of a Preference List and Strategy `best nonfirst' -- 4 Strategy `min max' -- 4.1 Critical Rank -- 4.2 Algorithm for Strategy `min max' -- References
  • Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search
  • 3.1 Properties of Minimal-Perimeter Polyominoes -- 4 Inflating a Minimal-Perimeter Polyomino -- 5 Conclusion -- References -- Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Contributions -- 2 Preliminaries -- 2.1 Convex-Straight-Skeleton Voronoi Diagrams -- 3 Tools for Constructing Convex Straight-Skeleton Voronoi Diagrams -- 3.1 Tools for Line Segments -- 3.2 Tools for Convex Polygonal Sites -- 4 Computing a Compact Convex Straight-Skeleton Voronoi Diagram -- References -- Polygon Queries for Convex Hulls of Points -- 1 Introduction -- 2 Axis-Parallel Rectangle Queries for Convex Hulls -- 2.1 Two-Layer Grid-Like Range Tree -- 2.2 Query Algorithm -- 3 O-oriented Triangle Queries for Convex Hulls -- 3.1 Three-Layer Grid-Like Range Tree -- 3.2 Query Algorithm -- 4 O-oriented Polygon Queries for Convex Hulls -- References -- Synergistic Solutions for Merging and Computing Planar Convex Hulls -- 1 Introduction -- 2 Computing the Union of Upper Hulls -- 2.1 Description of the Algorithm Quick Union Hull -- 2.2 Complexity Analysis of the Quick Union Hull Algorithm -- 3 Synergistic Computation of Convex Hulls -- 3.1 Linear Time Partitioning Algorithm -- 3.2 Synergistic Algorithm to Compute the Convex Hull -- References -- Cophenetic Distances: A Near-Linear Time Algorithmic Framework -- 1 Introduction -- 2 Definitions -- 3 Results -- 3.1 Median Node in a Rooted Tree -- 3.2 Classification of Taxa Pairs -- 3.3 The Partial Distance of Non-mixed Types -- 3.4 The Partial Distance of Double Mixed Types -- 3.5 The Partial Distance of Single Mixed Types -- 3.6 Time Complexity -- 3.7 Partial Distances Under the L2 Cophenetic Distance -- 4 Scalability Analysis -- 5 Conclusion -- References -- Computing Coverage Kernels Under Restricted Settings -- 1 Introduction -- 2 Preliminaries
  • 5 O(r)-Approximation for the Coclustering Setting -- 6 Conclusion -- References -- Approximation Algorithms for a Two-Phase Knapsack Problem -- 1 Introduction -- 2 Problem Description -- 3 Approximation Algorithms Using the Largest Size Boxes -- 3.1 A 14-Approximation LP Rounding Algorithm -- 3.2 Approximation Algorithm Based on MKP and KP Algorithms -- 4 A Polynomial Time Approximation Scheme -- 5 Conclusions -- References -- More Routes for Evacuation -- 1 Introduction -- 2 Preliminary -- 3 Enumerating All Spanning Subgraphs -- 3.1 2-Edge-Connected Spanning Subgraphs in Plane Graphs -- 3.2 k-Edge-Connected Spanning Subgraphs in General Graphs -- 4 Conclusions -- References -- Fine-Grained Parameterized Complexity Analysis of Knot-Free Vertex Deletion - A Deadlock Resolution Graph Problem -- 1 Introduction -- 2 Preliminaries -- 3 W[1]-Hardness -- 4 Additional Parameters -- 4.1 The Size of the Largest Strongly Connected Component as a Parameter -- 4.2 Number of Vertices with Few Out-Edges as a Parameter -- 5 Conclusions -- References -- Approximating Global Optimum for Probabilistic Truth Discovery -- 1 Introduction -- 1.1 Our Results -- 1.2 Our Techniques -- 2 Problem Formulation and Main Results -- 2.1 Probabilistic Truth Discovery -- 3 Solution for General 1-Center Optimization Problem -- 3.1 General Description of the Algorithm -- 3.2 The Choice of L -- 3.3 Main Result -- References -- Online Interval Scheduling to Maximize Total Satisfaction -- 1 Introduction -- 2 Model Description -- 3 General Profit Case -- 4 Upper Bounds for Uniform Profit Case -- 4.1 Preliminaries -- 4.2 Overview of Analysis -- 4.3 Analysis of GR -- 4.4 Upper Bound for m = 2 -- 5 Lower Bounds for Uniform Profit Case -- References -- Properties of Minimal-Perimeter Polyominoes -- 1 Introduction -- 2 Preliminaries -- 3 Border, Perimeter, and Excess