Computing and combinatorics : 28th International Conference, COCOON 2022, Shenzhen, China, October 22-24, 2022 : proceedings
This book constitutes the proceedings of the 28th International Conference on Computing and Combinatorics, COCOON 2022, held in Shenzhen, China, in October 2022.The 39 full papers together with 12 short papers presented in this volume were carefully reviewed and selected from 101 submissions. The pa...
Saved in:
| Main Authors | , , , |
|---|---|
| Format | eBook Book |
| Language | English |
| Published |
Cham
Springer
2022
Springer International Publishing AG Springer International Publishing |
| Edition | 1 |
| Series | Lecture notes in computer science |
| Subjects | |
| Online Access | Get full text |
| ISBN | 3031221044 9783031221040 |
Cover
Loading…
| Abstract | This book constitutes the proceedings of the 28th International Conference on Computing and Combinatorics, COCOON 2022, held in Shenzhen, China, in October 2022.The 39 full papers together with 12 short papers presented in this volume were carefully reviewed and selected from 101 submissions. The papers focus on subjects such as Algorithmica, Theoretical Computer Science, Journal of Combinatorial Optimization and others. |
|---|---|
| AbstractList | This book constitutes the proceedings of the 28th International Conference on Computing and Combinatorics, COCOON 2022, held in Shenzhen, China, in October 2022.The 39 full papers together with 12 short papers presented in this volume were carefully reviewed and selected from 101 submissions. The papers focus on subjects such as Algorithmica, Theoretical Computer Science, Journal of Combinatorial Optimization and others. |
| Author | International Computing and Combinatorics Conference Miao, Dongjing Zhang, Yong Möhring, R. H. (Rolf H.) |
| Author_xml | – sequence: 1 fullname: International Computing and Combinatorics Conference – sequence: 2 fullname: Zhang, Yong – sequence: 3 fullname: Miao, Dongjing – sequence: 4 fullname: Möhring, R. H. (Rolf H.) |
| BackLink | https://cir.nii.ac.jp/crid/1130577729740292239$$DView record in CiNii |
| BookMark | eNpVkE1LxDAQhiN-oLvuf8hBEGEXkkmbtN60-LEg9qB4LWkydet2k7WpCuKPN-7qwcPMMC8P7wzviOw573CHTHKVCSY4AGep2iWjvyVJDsiIi1QxnknBDskkhBfGGGSCc5Ecka_Cr9ZvQ-ueqXaWGr-qW6cH37cm0HMK2bCgczdgH8XWO93RwrsGe3QGp7Qoi7K8p8AApvRhge4zVpQX0WNKSzP4GnsKMINkuqGi5br3BtHGi-GY7De6Czj5nWPydH31WNzO7sqbeXFxN9NcQCZnFqzghqPljKvapnUilJQ1MJnaLAXMuNEsjSgmmlkrLeSaN1Y0DVNSpFKMydnWWIclfoSF74ZQvXdYe78M1b_wInu6ZeOjr28YhmqDGXRDr7vq6rJQXMZAk0iebEnXtpVpf3oMNXooBblKGOQAIhffWw91bQ |
| ContentType | eBook Book |
| DBID | RYH |
| DEWEY | 004.015116 |
| DatabaseName | CiNii Complete |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9783031221057 3031221052 |
| Edition | 1 |
| ExternalDocumentID | 9783031221057 EBC7165704 BD02178643 |
| GroupedDBID | 38. AABBV AAZWU ABSVR ABTHU ABVND ACBPT ACHZO ACPMC ADNVS AEDXK AEJLV AEKFX AHVRR AIYYB ALMA_UNASSIGNED_HOLDINGS BBABE CZZ IEZ RYH SBO TPJZQ TSXQS Z7R Z7U Z7X Z7Z Z81 Z83 Z84 Z85 Z88 |
| ID | FETCH-LOGICAL-a13286-d2d31c1ed1017bd5b43766b2065d852e81ca05328e4a0dd6d29a1fd3ff0763563 |
| ISBN | 3031221044 9783031221040 |
| IngestDate | Wed Apr 23 04:06:52 EDT 2025 Fri May 30 22:48:35 EDT 2025 Thu Jun 26 22:58:34 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCallNum_Ident | QA75.5-76.95 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a13286-d2d31c1ed1017bd5b43766b2065d852e81ca05328e4a0dd6d29a1fd3ff0763563 |
| Notes | Includes bibliographical references and index |
| OCLC | 1357018630 |
| PQID | EBC7165704 |
| PageCount | 600 |
| ParticipantIDs | askewsholts_vlebooks_9783031221057 proquest_ebookcentral_EBC7165704 nii_cinii_1130577729740292239 |
| PublicationCentury | 2000 |
| PublicationDate | c2022 2023 2023-01-01 |
| PublicationDateYYYYMMDD | 2022-01-01 2023-01-01 |
| PublicationDate_xml | – year: 2022 text: c2022 |
| PublicationDecade | 2020 |
| PublicationPlace | Cham |
| PublicationPlace_xml | – name: Cham |
| PublicationSeriesTitle | Lecture notes in computer science |
| PublicationYear | 2022 2023 |
| Publisher | Springer Springer International Publishing AG Springer International Publishing |
| Publisher_xml | – name: Springer – name: Springer International Publishing AG – name: Springer International Publishing |
| SSID | ssj0002831134 |
| Score | 2.4298148 |
| Snippet | This book constitutes the proceedings of the 28th International Conference on Computing and Combinatorics, COCOON 2022, held in Shenzhen, China, in October... |
| SourceID | askewsholts proquest nii |
| SourceType | Aggregation Database Publisher |
| SubjectTerms | Combinatorial analysis Combinatorial analysis -- Data processing -- Congresses Computer science Computer science -- Mathematics -- Congresses |
| TableOfContents | 2.1 Generalized Magician's Problem [Sect. 7]ch9alaei2014bayesian -- 3 Approximation Algorithm -- 3.1 A First Approximation Strategy -- 4 A Strategy Without Magicians for the Cases Without Assignment Costs -- 5 Applications in Real-Time Line Planning Problem (RLPP) -- 5.1 Numerical Experiments -- References -- On the Complexity of Minimum Maximal Acyclic Matchings -- 1 Introduction -- 2 Hardness Difference -- 3 NP-Completeness Result -- 4 Approximation Hardness -- 5 APX-Hardness for 4-Regular Graphs -- 6 Open Problems -- References -- Online Non-monotone DR-Submodular Maximization: 1/4 Approximation Ratio and Sublinear Regret -- 1 Introduction -- 2 Preliminaries -- 3 Problem Statement -- 4 Algorithm and Performance Analysis -- 5 Conclusion -- References -- Fair Division with Minimal Withheld Information in Social Networks -- 1 Introduction -- 2 Preliminaries -- 3 Attainability Problems -- 3.1 Lower Bounds on the Number of Hidden Items -- 3.2 Algorithms Finding the Sufficient Number of Hidden Items -- 4 Existence Problems -- 5 Verification Problems -- References -- Facility Location Games with Ordinal Preferences -- 1 Introduction -- 2 Preliminaries -- 3 Unknown Preferences -- 3.1 Maximum Cost -- 3.2 Total Cost -- 3.3 Minimum Utility -- 3.4 Total Utility -- 4 Unknown Locations -- 4.1 Minimizing the Maximum and Total Costs -- 4.2 Maximizing the Minimum and Total Utilities -- 5 Conclusion -- References -- Fully Dynamic k-Center Clustering with Outliers -- 1 Introduction -- 2 Preliminaries -- 3 Algorithms and Analysis -- 4 Conclusion -- References -- Refutation of Spectral Graph Theory Conjectures with Monte Carlo Search -- 1 Introduction -- 2 Refutation of Graph Theory Conjectures -- 2.1 Graph Theory Conjectures -- 2.2 Algorithms Used to Refute Graph Conjectures -- 3 Algorithms -- 3.1 Monte Carlo Search -- 3.2 Nested Monte Carlo Search Facility Location Games with Group Externalities Intro -- Preface -- Organization -- Contents -- A Stochastic Non-monotone DR-Submodular Maximization Problem over a Convex Set -- 1 Introduction -- 2 Preliminaries -- 3 The SPIDER Frank-Wolfe Algorithm and Its Analysis -- 4 Conclusions -- References -- Flow Shop Scheduling Problems with Transportation Constraints Revisited -- 1 Introduction -- 2 PTAS for TF2|v=1,c1|Cmax -- 2.1 Construct an Instance of F3 Based on a Given Instance of TF2 -- 2.2 Construct a Feasible Schedule of TF2 Based on a Known Schedule of F3 -- 2.3 Construct a Feasible Schedule of F3 Based on a Known Schedule of TF2 -- 2.4 PTAS for Problem TF2 -- 3 PTAS for F2D|v=1,c1|Cmax -- 3.1 Construct an Instance of F3 Based on a Given Instance of F2D -- 3.2 Construct a Feasible Schedule of F2D Based on a Known Schedule of F3 -- 3.3 Construct a Feasible Schedule of F3 Based on a Known Schedule of F2D -- 3.4 PTAS for Problem F2D -- 4 Conclusion -- References -- LotterySampling: A Randomized Algorithm for the Heavy Hitters and Top-k Problems in Data Streams -- 1 Introduction -- 2 Problem Formulation -- 2.1 Heavy Hitters -- 2.2 Top-k -- 3 The Algorithms -- 3.1 LotterySampling for Heavy Hitters -- 3.2 LotterySampling for Top-k -- 4 Comparison with Previous Work -- 4.1 Heavy Hitters -- 4.2 Top-k -- 5 Conclusion -- References -- Approximation Algorithms for the Min-Max Mixed Rural Postmen Cover Problem and Its Variants -- 1 Introduction -- 2 Notations -- 3 Min-Max Mixed Rural Postmen Cover Problem -- 3.1 Tour Split and Allocation -- 3.2 Find Tour -- 3.3 Algorithm Analysis -- 4 Min-Max Mixed Rural Postmen Walk Cover Problem -- 5 Min-Max Mixed Chinese Postmen Cover Problem -- 6 Conclusions -- References -- Large k-Gons in a 1.5D Terrain -- 1 Introduction -- 2 Case k=2: Diameter of the Terrain -- 3 Case k=3: Largest Perimeter Triangle -- 4 An FPTAS for *k 4.1 Preparation for Using Data Structures -- 4.2 A Largest Perimeter Triangle with Vertices on Three Intervals -- 5 Extension to Convex Polygons of at Most k Vertices -- 5.1 Perimeter Measure -- 5.2 Area Measure -- References -- Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-In Cascading Circuits -- 1 Background and Main Contributions -- 1.1 The Language Families kSDA and LOGkSDA -- 1.2 Nondeterministic Variants: k-sna's and aux-k-sna's -- 2 Basic Models of Computation -- 2.1 Auxiliary Storage Automata with Depth-Bounded Storage Tapes -- 2.2 Cascading Circuits with Semi-unbounded Fan-in Gates -- 3 Simulations Between Auxiliary SNAs and Cascading Circuit Families -- References -- Analysis of Approximate Sorting in I/O Model -- 1 Introduction -- 1.1 Background -- 1.2 Related Work -- 1.3 Measure of Approximate Results -- 1.4 Contribution -- 2 Preliminary and Problem Statement -- 2.1 I/O Model -- 2.2 New Metric: Errors -- 2.3 New Metric: ESP -- 2.4 Approximate Sorting in I/O Model -- 3 Theoretical Bound -- 3.1 Rate-Distortion Theory in I/O Model -- 3.2 Rate-Distortion Relationship for dee -- 3.3 Rate-Distortion Relationship for desp -- 4 Lower Bound -- 4.1 The Lower Bound of dee -- 4.2 The Lower Bound of desp -- 5 k-Pass Approximate Sorting Algorithm -- 5.1 Average ESP Metric of Algorithm -- 5.2 Average EE Metric of Algorithm -- 6 Future Work -- 7 Conclusion -- References -- Two Generalizations of Proper Coloring: Hardness and Approximability -- 1 Introduction -- 2 Preliminaries -- 3 Split Graphs and General Relations -- 4 Case of Two Colors -- 5 Perfect Graphs -- 6 Approximation Algorithms for Unit-Disk Graphs -- 6.1 Non-geometric Approach -- References -- Approximation Algorithms for Capacitated Assignment with Budget Constraints and Applications in Transportation Systems -- 1 The Problem -- 2 Related Work 3 Problem 1|split|(Cmax)k+JjRej -- 4 Problem 1||(Cmax)k+ JjRej -- 4.1 NP-Hardness Proof When k> -- 1 -- 4.2 Dynamic Programming Algorithms -- 4.3 Approximation Algorithms -- References -- Escape from the Room -- 1 Introduction -- 2 Preliminaries -- 3 Family Tree -- 4 Algorithm -- 5 Data Structure -- 6 Conclusion -- References -- Algorithms for Hard-Constraint Point Processes via Discretization -- 1 Introduction -- 1.1 Hard-Constraint Point Processes -- 1.2 Reduction to a Discrete Hard-Core Model -- 1.3 Approximation Algorithms via Canonical Discretization -- 1.4 Sampling via Random Perturbations -- 1.5 Discussion and Future Directions -- References -- Space Limited Graph Algorithms on Big Data -- 1 Introduction -- 2 Constructing a Maximal Matching -- 3 Kernelization for Edge Dominating Set -- 3.1 The First Kernelization Algorithm for P-EDS -- 3.2 A New Kernelization Algorithm for P-EDS -- 4 Conclusion and Final Remarks -- References -- Counting Cycles on Planar Graphs in Subexponential Time -- 1 Introduction -- 1.1 Overview -- 2 Self-Avoiding Walks and Partial Self-avoiding Walks -- 3 The Algorithm -- 3.1 Computing 69640972 CS(1, 2) 86418188 -- 3.2 Computing 69640972 CD, S() 86418188 -- 3.3 Computing 69640972 WG 86418188 -- 4 Extensions -- References -- Semi-strict Chordal Digraphs -- 1 Introduction -- 2 Weakly Quasi-Transitive Semi-strict Chordal Digraphs -- 3 Locally Semicomplete Semi-strict Chordal Digraphs -- 4 Conclusion and Open Problems -- References -- Reallocation Problems with Minimum Completion Time -- 1 Introduction -- 2 Preliminaries -- 3 Algorithms for the Reallocation Problems -- 4 Intractability Results -- References -- The Bound Coverage Problem by Aligned Disks in L1 Metric -- 1 Introduction -- 2 Preliminaries -- 3 A Fully Polynomial Time Approximation Scheme -- 4 Conclusion -- References 3.3 Nested Rollout Policy Adaptation -- 3.4 Greedy Best First Search -- 4 Graph Generation -- 5 Experiments on Conjectures -- 5.1 Conjecture 1. AutoGraphiX -- 5.2 Conjecture 2. Aouchiche-Hansen -- 5.3 Conjecture 3. Collins -- 5.4 Conjecture 4. Graffiti 137 -- 5.5 Comparison of Search Algorithms -- 6 Conclusion -- A Appendix - Algorithms -- B Appendix - Graphs -- References -- Online One-Sided Smooth Function Maximization -- 1 Introduction -- 1.1 Organizations -- 2 Preliminaries -- 3 The Approximation Algorithm and Its Analysis -- 3.1 Jump Start Meta Frank Wolfe Algorithm -- 3.2 Approximation Ratio -- 4 Conclusion -- References -- Revisiting Maximum Satisfiability and Related Problems in Data Streams -- 1 Introduction -- 2 Streaming Algorithms for Max-SAT -- 3 Streaming Algorithms for Min-SAT -- References -- Turing Machines with Two-Level Memory: A Deep Look into the Input/Output Complexity -- 1 Introduction -- 1.1 Related Works -- 2 Turing Machine with Two-Level Memory -- 2.1 Definition of Turing Machine with Two-Level Memory -- 2.2 TM-TLM v.s. Turing Machine -- 2.3 TM-TLM v.s. Block Transfer TM-TLM -- 2.4 IO Complexity v.s. Parameterized Complexity -- 3 The Random Access Turing Machine with Two-Level Memory -- 4 The Random Access Turing Machine with Blocking-IO -- 4.1 The Definition of Random Access Turing Machine with Blocking-IO -- 4.2 The External Access Trace Complexity -- 5 Conclusion -- References -- A Quantum Version of Pollard's Rho of Which Shor's Algorithm is a Particular Case -- 1 Introduction -- 2 A Characterization of Nontrivial Collisions -- 3 A Quantum Version of Pollard's Rho -- References -- Single Machine Scheduling with Rejection to Minimize the k-th Power of the Makespan -- 1 Introduction -- 1.1 Scheduling to Minimize the k-th Power of the Makespan -- 1.2 Scheduling with Rejection -- 2 Problem Formulation |
| Title | Computing and combinatorics : 28th International Conference, COCOON 2022, Shenzhen, China, October 22-24, 2022 : proceedings |
| URI | https://cir.nii.ac.jp/crid/1130577729740292239 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=7165704 https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9783031221057 |
| Volume | 13595 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3da9swEBdp9rK-dJ8s7TrE2FviEEn-0l7GkmWEsjUwutI9GdmWl6zFgcbdQ-kf3ztZ_og7GNuLUA7nLO4ndB_W3RHyTvhSZkoLRyoROK6fZk6YqcRRKtEJnIWCmfLFX0_9xXf35MK76PU-tG4t3RTxOLn9Y17J_6AKNMAVs2T_AdmaKRBgDvjCCAjD2DF-65-2poDpxVDlFwJr8G-VKfexNT4-D4tVJ9jXpPaZ2OhytlyeDjnoVhP_XOn81uZpmI7aOFkmBV67HoIfyV0k4NOGfaP1aou8-7L2-mY762sW8iBo_WNj9ahJUlSb0sLPf_5at-j4aX_qr65tM5Zv4-FiXAZCrjKYVqENG8ngvBPJqCKZOx4uaFjGwS0tazp1SmNPP6FHFYJRtUf2ggAOtUcf5ydfzusgG8e9JrC1V82nLAbZ4rtP9tX2EjQKaJtiCyZGvl4_UMzG2jh7QvqYgfKU9HT-jBxUfTeoPYafk7tavBTES3fgp-8pgk938KCNzEe0hJ6iaEa0Ah7ICPuIWtCpAX1kngKWLcBfkPPP87PZwrFdNBzFBA99J-WpYAnTKZ6-cerFLigVP-ZgfKahx3XIEoX9QULtqgk2GONSsSwVWTYx1QvFS9LPN7l-RaiWSmUeC7X2pOtK7HTGWebzQMs04DwZkLctWUa_r8wX_23UErgXDMgxiDhK1jgCPEBCFy9wJ8CPCzkgtBJ-ZP5vrylH8-kMvHsvmLiHf2FxRB43G-w16RfXN_oYjMcifmO3yD3qz2M1 |
| 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+28th+International+Conference%2C+COCOON+2022%2C+Shenzhen%2C+China%2C+October+22-24%2C+2022+%3A+proceedings&rft.au=International+Computing+and+Combinatorics+Conference&rft.au=Zhang%2C+Yong&rft.au=Miao%2C+Dongjing&rft.au=M%C3%B6hring%2C+R.+H.+%28Rolf+H.%29&rft.date=2022-01-01&rft.pub=Springer&rft.isbn=9783031221040&rft.externalDocID=BD02178643 |
| thumbnail_m | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97830312%2F9783031221057.jpg |