Computing and Combinatorics 25th International Conference, COCOON 2019, Xi'an, China, July 29-31, 2019, Proceedings
This book constitutes the proceedings of the 25th International Conference on Computing and Combinatorics, COCOON 2019, held in Xi'an, China, in July 2019. The 55 papers presented in this volume were carefully reviewed and selected from 124 submissions. The papers cover various topics, includin...
Saved in:
| Main Authors | , , , |
|---|---|
| Format | eBook Book |
| Language | English |
| Published |
Cham
Springer Nature
2019
Springer Springer International Publishing AG |
| Edition | 1 |
| Series | Theoretical Computer Science and General Issues |
| Subjects | |
| Online Access | Get full text |
| ISBN | 9783030261764 303026176X 9783030261757 3030261751 |
Cover
Loading…
| Abstract | This book constitutes the proceedings of the 25th International Conference on Computing and Combinatorics, COCOON 2019, held in Xi'an, China, in July 2019. The 55 papers presented in this volume were carefully reviewed and selected from 124 submissions. The papers cover various topics, including algorithm design, approximation algorithm, graph theory, complexity theory, problem solving, optimization, computational biology, computational learning, communication network, logic, and game theory. |
|---|---|
| AbstractList | This book constitutes the proceedings of the 25th International Conference on Computing and Combinatorics, COCOON 2019, held in Xi'an, China, in July 2019. The 55 papers presented in this volume were carefully reviewed and selected from 124 submissions. The papers cover various topics, including algorithm design, approximation algorithm, graph theory, complexity theory, problem solving, optimization, computational biology, computational learning, communication network, logic, and game theory. |
| Author | Du, Dingzhu Tian, Cong Duan, Zhenhua International Computing and Combinatorics Conference |
| Author_xml | – sequence: 1 fullname: International Computing and Combinatorics Conference – sequence: 2 fullname: Du, Dingzhu – sequence: 3 fullname: Duan, Zhenhua – sequence: 4 fullname: Tian, Cong |
| BackLink | https://cir.nii.ac.jp/crid/1130000798251730944$$DView record in CiNii |
| BookMark | eNpdz01LAzEQBuCIH2hrf4GXIoJ4KGSSzSY56lI_oOBFvIZJNtuu3SZ1s7V_363rRS8zDDy8zDsiJyEGf0QmWipOOWU5yDw7_nefkREAUNBCgTwnk5Q-KKWMUaWFuCBXRdxsd10dllMM5bS_bB2wi23t0iU5rbBJfvK7x-T9cf5WPM8Wr08vxf1ihiAE5DNLMXcVel9ixa0uBerSSa4EMIsUFc-10pVy3FHnrMtKkJp6baucyaz_k4_J3RCMae33aRWbLpmvxtsY18n8qdPb28Fu2_i586kzP8z50LXYmPlDITQTksle3gwy1LVx9WEC8L48lVoxAZJTnR0CrwfmMGHTM7OJIS5b3K6SERloCYJ_A4ZLZDs |
| ContentType | eBook Book |
| DBID | I4C RYH |
| DEWEY | 005 |
| DatabaseName | Casalini Torrossa eBooks Institutional Catalogue CiNii Complete |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9783030261764 303026176X |
| Edition | 1 1st Edition 2019 |
| Editor | Tian, Cong Duan, Zhenhua Du, Ding-Zhu |
| Editor_xml | – sequence: 1 fullname: Du, Ding-Zhu – sequence: 2 fullname: Duan, Zhenhua – sequence: 3 fullname: Tian, Cong |
| ExternalDocumentID | 9783030261764 EBC5925727 BB28737393 5419715 |
| GroupedDBID | 38. AABBV AEDXK AEKFX AIFIR ALEXF ALMA_UNASSIGNED_HOLDINGS AYMPB BBABE CXBFT CZZ EXGDT FCSXQ I4C IEZ LDH MGZZY NSQWD OORQV SBO TPJZQ TSXQS Z7R Z7X Z7Y Z81 Z83 Z88 AAJYQ AATVQ ABBUY ABCYT ACDTA ACDUY AEHEY AEJLV AHNNE ATJMZ RYH Z7U |
| ID | FETCH-LOGICAL-a15516-b0a6cfaeedaf3b9d5a9dc738512ba0a836989f8c3c0ccbc4d1790e9bf62743023 |
| ISBN | 9783030261764 303026176X 9783030261757 3030261751 |
| IngestDate | Fri Nov 08 03:58:11 EST 2024 Thu Apr 24 04:17:10 EDT 2025 Thu Jun 26 23:56:11 EDT 2025 Tue Nov 14 22:54:05 EST 2023 |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCallNum_Ident | Q |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a15516-b0a6cfaeedaf3b9d5a9dc738512ba0a836989f8c3c0ccbc4d1790e9bf62743023 |
| Notes | Includes bibliographical references and index |
| OCLC | 1110195817 |
| PQID | EBC5925727 |
| PageCount | 691 |
| ParticipantIDs | askewsholts_vlebooks_9783030261764 proquest_ebookcentral_EBC5925727 nii_cinii_1130000798251730944 casalini_monographs_5419715 |
| PublicationCentury | 2000 |
| PublicationDate | 2019 c2019 2019-07-24 |
| PublicationDateYYYYMMDD | 2019-01-01 2019-07-24 |
| PublicationDate_xml | – year: 2019 text: 2019 |
| PublicationDecade | 2010 |
| PublicationPlace | Cham |
| PublicationPlace_xml | – name: Netherlands – name: Cham |
| PublicationSeriesTitle | Theoretical Computer Science and General Issues |
| PublicationYear | 2019 |
| Publisher | Springer Nature Springer Springer International Publishing AG |
| Publisher_xml | – name: Springer Nature – name: Springer – name: Springer International Publishing AG |
| SSID | ssj0002208955 |
| Score | 2.2141042 |
| Snippet | This book constitutes the proceedings of the 25th International Conference on Computing and Combinatorics, COCOON 2019, held in Xi'an, China, in July 2019. The... |
| SourceID | askewsholts proquest nii casalini |
| SourceType | Aggregation Database Publisher |
| SubjectTerms | Combinatorial analysis -- Data processing -- Congresses Computer programming, programs, data Computer science -- Mathematics -- Congresses Computer software-Quality control |
| Subtitle | 25th International Conference, COCOON 2019, Xi'an, China, July 29-31, 2019, Proceedings |
| TableOfContents | 2 Hardness Results -- 3 A Very Fast Exact Exponential Time Algorithm for Graphs with Large Minimum Degree -- 4 Polynomial-Time Solvable Cases: Graphs with Very Large Minimum Degree -- 4.1 Dirac and Ore Graphs -- 5 Conclusion -- References -- Incremental Optimization of Independent Sets Under the Reconfiguration Framework -- 1 Introduction -- 2 Preliminaries -- 3 Polynomial-Time Solvability -- 3.1 Hardness Results -- 3.2 Linear-Time Algorithm for Chordal Graphs -- 4 Fixed Parameter Tractability -- 4.1 Single Parameter: Solution Size -- 4.2 Two Parameters: Solution Size and Degeneracy -- 5 Conclusion -- References -- Deconstructing Parameterized Hardness of Fair Vertex Deletion Problems -- 1 Introduction and Motivation -- 1.1 Previous Work and Deconstructing Hardness -- 1.2 Our Results -- 2 Preliminaries -- 3 FAIR VERTEX DELETION Parameterized by Treewidth + Fairness Factor -- 4 FAIR q-HITTING SET Parameterized by Solution Size -- 4.1 FPT Algorithm -- 4.2 Polynomial Kernel -- 4.3 Improved Kernel for FVC Parameterized by Solution Size -- 5 Hardness Results -- 5.1 W[1]-Hardness for Fair Set -- 5.2 NP-Hardness of FVC and FFVS -- 6 Conclusion -- References -- On 1-Factorizations of Bipartite Kneser Graphs -- 1 Introduction -- 1.1 Motivation and Related Work -- 1.2 Preliminaries -- 2 Construct ``resolvable'' 1-Factorizations of H(v,t) -- 2.1 Applications of Theorem 1 -- 3 Revisit the Lexical Factorization -- 3.1 Preliminary Lemmas -- 3.2 Finding Resolved Functions {gA} of fLEX -- 3.3 Linear Time Algorithms for P1 and P2 -- 3.4 Variation Laws of fLEX -- 4 Revisit the Modular Factorization -- References -- An Optimal Algorithm for 2-Bounded Delay Buffer Management with Lookahead -- 1 Introduction -- 2 Model Description -- 3 Matching Upper Bound -- 3.1 Notation and Definitions -- 3.2 Idea Behind Algorithm Design -- 3.3 Algorithm -- 3.4 Overview of the Analysis Intro -- Preface -- Organization -- Contents -- Fully Dynamic Arboricity Maintenance -- 1 Introduction -- 1.1 Our Results -- 1.2 Previous Work, Methodology and Organization of the Paper -- 2 Preliminaries -- 2.1 Data Structure -- 2.2 The Auxiliary Graph -- 2.3 An Incremental Algorithm -- 3 Insertion in (m) Time -- 4 Fully Dynamic Algorithm -- 5 An (logn) Lower Bound -- 6 Conclusion -- References -- A Lower Bound on the Growth Constant of Polyaboloes on the Tetrakis Lattice -- 1 Introduction -- 2 Preliminaries -- 3 Properties -- 4 The Bound -- 5 A Conditional Better Bound -- 6 Conclusion -- References -- An FPTAS for a General Class of Parametric Optimization Problems -- 1 Introduction -- 2 Preliminaries -- 3 An FPTAS -- 4 Applications -- References -- Geodesic Fault-Tolerant Additive Weighted Spanners -- 1 Introduction -- 2 Vertex Fault-Tolerant Additive Weighted Spanner for Points in a Polygonal Domain -- 3 Vertex Fault-Tolerant Additive Weighted Spanner for Points on a Terrain -- References -- Diameter of Colorings Under Kempe Changes -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Contribution -- 2 Preliminaries -- 3 PSPACE-Completeness -- 3.1 PSPACE-Hardness for k=3 and Planar Graphs -- 3.2 PSPACE-Hardness for Any Fixed k 3 -- 4 Classes of Perfect Graphs -- 4.1 Chordal Graphs -- 4.2 Bipartite Graphs -- 4.3 Cographs -- 5 Conclusion -- References -- Dominating Set on Overlap Graphs of Rectangles Intersecting a Line -- 1 Introduction and Results -- 2 Proof of Theorem 1 -- 3 Necessary Lemmas to Prove Theorem 2 -- 3.1 Proof of Lemma 3 -- 3.2 Proof of Lemma 1 -- 4 Proof of Theorem 2 -- References -- Minimizing the Cost of Batch Calibrations -- 1 Introduction -- 1.1 Related Works -- 1.2 Our Problem -- 1.3 Our Contributions and Organization of the Paper -- 2 Preliminaries -- 3 An Optimal Polynomial Time Algorithm for Arbitrary Cost Function A Simple Construction of Broadcast Graphs -- 1 Introduction -- 2 Important Graphs -- 3 Trivial Compounding -- 4 A New Graph Construction -- 5 Broadcast Algorithm -- 6 Conclusion -- References -- No-Bend Orthogonal Drawings and No-Bend Orthogonally Convex Drawings of Planar Graphs (Extended Abstract) -- 1 Introduction -- 2 Preliminaries -- 3 No-Bend Orthogonal Drawings -- 4 No-Bend Orthogonally Convex Drawings -- 5 Conclusions -- References -- Branch-and-Cut Algorithms for Steiner Tree Problems with Privacy Conflicts -- 1 Introduction -- 2 Privacy-Oriented Optimization Models -- 2.1 STP with Path-Privacy Conflicts -- 2.2 STP with Branch-Privacy Conflicts -- 3 Integer Programming Formulations -- 4 Cutting Planes -- 4.1 Valid Inequalities -- 4.2 Cut Generation -- 5 Computational Study -- 6 Conclusion -- References -- 3D Path Network Planning: Using a Global Optimization Heuristic for Mine Water-Inrush Evacuation -- 1 Introduction -- 2 Modeling of Mine Network Using the Graph Concept and Problem Formulation -- 2.1 The Spatial Hierarchy Analysis of Mine Network -- 2.2 The Traffic Capacity Analysis of Mine Network -- 2.3 Problem Definitions and Hardness Results -- 3 Global-Optimized Evacuation Paths Algorithm -- 3.1 Auxiliary Graph G* Induction -- 3.2 MWSC-based Strategy to Construct Global Optimized Multi-path in G* -- 3.3 Paths Reduction for G from the Multi-path in G* -- 4 Simulation and Discussion -- 4.1 Simulation Plan -- 4.2 Performance of Proposed Algorithms for GMF Problem -- 5 Conclusions -- References -- Max-Min 3-Dispersion Problems -- 1 Introduction -- 2 3-Dispersion in L Metric -- 3 3-Dispersion in L1 -- 4 3-Dispersion in L2 Metric -- 5 Conclusion -- References -- Matching Cut in Graphs with Large Minimum Degree -- 1 Introduction -- 1.1 Previous Results -- 1.2 Our Contributions -- 1.3 Notation and Terminology -- 1.4 Structure of the Paper 3.1 Learning Disjunctions with Random Examples -- 3.2 Learning with Membership Queries -- 4 Exactly Learning s-DNFs -- 4.1 Learning s-DNFs Under Any Distributions -- 4.2 Learning s-DNFs with Not Many Narrow Terms Under Uniform Distributions -- 4.3 Learning Under Bounded-Appearance of All Literals -- References -- Interactive Physical Zero-Knowledge Proof for Norinori -- 1 Introduction -- 2 Preliminaries -- 2.1 Physical Objects -- 2.2 Pile-Scramble Shuffle -- 2.3 Pile-Shifting Shuffle -- 2.4 Card Choosing Protocol -- 3 Zero-Knowledge Proof for Norinori -- 4 Security Analysis -- 5 Conclusion -- References -- On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models -- 1 Introduction -- 2 Preliminaries -- 3 Construction of Hard Parameterized Polynomials -- 4 Lower Bounds -- 4.1 ROABP -- 4.2 Strict Interval ABPs -- 4.3 Rank Bound for ROPs by Graph Representation -- 5 Conclusions -- References -- Many-to-One Popular Matchings with Two-Sided Preferences and One-Sided Ties -- 1 Introduction -- 2 Preliminaries -- 3 Many-to-One Multi-vote Popular Matching -- 3.1 Proof of Correctness -- 4 Verifying Popularity -- 4.1 Multi-vote Model -- 4.2 One-Vote Model -- References -- Feasibility Algorithms for the Duplication-Loss Cost -- 1 Introduction -- 2 Preliminaries -- 2.1 Basic Definitions -- 2.2 Feasibility Problems -- 3 Elementary Properties of Embeddings -- 4 Algorithm for DLF -- 5 Algorithm for MinDLF -- 6 Conclusion -- References -- Imbalance, Cutwidth, and the Structure of Optimal Orderings -- 1 Background -- 2 Preliminaries -- 3 True Twins, Minimal Imbalance, and Parameterization by Twin-Cover -- 4 Split Graphs -- 5 Proper Interval Graphs -- 5.1 Proper Interval k-Trees -- 6 Conclusion -- References -- Smaller Universal Targets for Homomorphisms of Edge-Colored Graphs -- 1 Introduction -- 2 Universal Graph Construction -- References 4 f(x)=b -- 5 f(x)=x -- 6 f(x)=x+b -- 7 Conclusion -- References -- Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes -- 1 Introduction -- 2 Preliminaries -- 3 Polynomial Families Complete for VP -- 3.1 Injective Homomorphisms -- 3.2 Directed and Injective Directed Homomorphisms -- 4 Polynomial Families Complete for VNP, VBP and VF -- References -- Chance-Constrained Submodular Knapsack Problem -- 1 Introduction -- 1.1 Background and Motivation -- 1.2 Contributions -- 2 Preliminaries -- 3 Normal Distribution Case -- 3.1 Problem Reformulation -- 3.2 Proposed Algorithm -- 4 Arbitrary Distribution Case -- 4.1 Problem Reformulation -- 4.2 Proposed Algorithm -- 5 Conclusions -- References -- Approximation Hardness of Travelling Salesman via Weighted Amplifiers -- 1 Introduction -- 2 Intermediate Weighted CSPs -- 3 The Weighted Bi-wheel Amplifiers -- 4 Gap Preserving Reduction from Hybrid(Wk,,p) to TSP -- 4.1 How to Construct a Tour from an Assignment -- 4.2 How to Define an Assignment from a Tour -- 5 Conclusion -- References -- Deleting to Structured Trees -- 1 Introduction -- 2 Preliminaries -- 3 NP-hardness -- 4 FPT Algorithms -- References -- Sensitivity, Affine Transforms and Quantum Communication Complexity -- 1 Introduction -- 2 Preliminaries -- 3 Warm Up: Alternation Under Shifts -- 4 Affine Transforms: Lower Bounds on Quantum Communication Complexity -- 4.1 Upper Bound for Block Sensitivity via Affine Transforms -- 4.2 From Block Sensitivity Lower Bound at 0n to Quantum Communication Lower Bounds -- 4.3 Putting Them Together -- 5 Linear Transforms: Sensitivity versus Sparsity -- References -- On Exactly Learning Disjunctions and DNFs Without Equivalence Queries -- 1 Introduction -- 2 Preliminaries -- 2.1 Exact Learning Without Equivalence Queries -- 3 Exactly Properly Learning Disjunctions References |
| Title | Computing and Combinatorics |
| URI | http://digital.casalini.it/9783030261764 https://cir.nii.ac.jp/crid/1130000798251730944 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=5925727 https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9783030261764 |
| Volume | 11653 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3fa9swEBZr-rK-bO02lmUpYhT60GT4l-xob01IKWE0L1kJezGSYhOz4MJsD9a_fneybMVZYXQvJlKUi7jP1t1J_u4IuQiR3-ilCmITCFcDLp2xdBJ_rLCoVcSU4yr9tsVdePstWKzZ2lZd0-ySUn5Wj0_ySv4HVegDXJEl-wxkW6HQAZ8BX7gCwnA9cH7bpskpoGsxNPxCEA3xrdDpPgod43us3B5s9llqn94bXc6Wy7srsMscm2uYRCTM-XtW08QW1e73lcdh-cRWM9IavNYZP_yf_anNOlOzc7D-s170YPjjtrKd9VS-b5N8W7V2Y5WZGT4Ya2s2K5Af1dmsaDYrO0EsGFGdF75OVH2Q_Xo6hZDOx7R9R-QoimDdOr6eL77et_tonudMOGNI22nkuHViJSv3hJyI4gcYDTAoZYEeiCgEEk_Bociz7C8zrH2L1WvSQ77JKXmR5GfkVVNlg5pF9w2pWo1S0CjtgE2_UISadiCgVs0jWgNNUUsjus4uRQ59CPGIIsBUAzwy3--B-5bc38xXs9uxKZYxFvqwEx4xEapUwCiR-pJvmOAbhbmKXE8KR0x8LBWaTpSvHKWkCjaYmy3hMsXqS1g66h3p5Q958p5QD5PYId19A8GBUK5UofIxkz-e-U5k2Cef9vQZ_9rpg_0i3lN6GPTJoFFzDM9dnYC9iFng8shlfTIEzccqw6uLZ6rgrHLkUYPJ4QH8mjaYxFq6eVc5nk9njIOd8aIP_xAxIC_tLfiR9MqfVTIED7KU5-Ym-gMPOmUv |
| linkProvider | Library Specific Holdings |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Computing+and+combinatorics+%3A+25th+International+Conference%2C+COCOON+2019%2C+Xi%27an%2C+China%2C+July+29-31%2C+2019%2C+proceedings&rft.au=International+Computing+and+Combinatorics+Conference&rft.au=Du%2C+Dingzhu&rft.au=Duan%2C+Zhenhua&rft.au=Tian%2C+Cong&rft.date=2019-01-01&rft.pub=Springer&rft.isbn=9783030261757&rft.externalDocID=BB28737393 |
| thumbnail_m | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97830302%2F9783030261764.jpg |