
Computing and Combinatorics
29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part II
Springer (Publisher)
Published on 9. December 2023
Book
Paperback/Softback
XVII, 419 pages
978-3-031-49192-4 (ISBN)
Description
This two volume set volume LNCS 14422-14423 constitutes the refereed proceedings of the 29th International Conference, COCOON 2023, held in Hawaii, HI, USA, during December 2023.
The 60 full papers were carefully reviewed and selected from 146 submissions. They are organized in the following topical sections:
Part I : Combinatorics and Algorithms; Algorithmic Solution in Applications; and Algorithm in Networks.
Part II: Complexity and Approximation; Graph Algorithms; and Applied Algorithms.
More details
Series
Edition
1st ed. 2024
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Target group
Professional and scholarly
Illustrations
31 s/w Abbildungen, 30 farbige Abbildungen
XVII, 419 p. 61 illus., 30 illus. in color.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 24 mm
Weight
663 gr
ISBN-13
978-3-031-49192-4 (9783031491924)
DOI
10.1007/978-3-031-49193-1
Schweitzer Classification
Other editions
Additional editions

Weili Wu | Guangmo Tong
Computing and Combinatorics
29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part II
E-Book
12/2023
Springer
€85.59
Available for download
Content
Complexity and Approximation
.- Complexity and Enumeration in Models of Genome Rearrangement.- Conditional automatic complexity and its metrics.- Streaming and Query Once Space Complexity of Longest Increasing Subsequence.- Approximating Decision Trees with Priority Hypotheses.- Approximating the $\lambda$-low-density Value.- Exponential Time Complexity of the Complex Weighted Boolean \#CSP.- Hardness and approximation for the star $p$-hub routing cost problem in $\Delta_\beta$-metric graphs.-
Graph Algorithms
.- Linear Time Algorithms for NP-hard Problems restricted to GaTEx Graphs.- Polynomial Turing Compressions for Some Graph Problems Parameterized by Modular-Width.- Shortest Longest-Path Graph Orientations.- Sink Location Problems in Dynamic Flow Grid Networks.- List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs.- Parameterized Algorithms for Cluster Vertex Deletion on Degree-4 Graphs and General Graphs.- Sum-of-Local-Effects Data Structures for Separable Graphs.-
Applied Algorithms
.- Variants of Euclidean k-center Clusterings.- Red-black Spanners for Mixed-charging Vehicular Networks.- Self-stabilizing (Delta+1)-Coloring in Sublinear (in Delta) Rounds via Locally-iterative Algorithms.- On Detecting Some Defective Items in Group Testing.- An Efficient Data Analysis Method for Big Data using Multiple-Model Linear Regression.- Multi-Load Agent Path Finding for Online Pickup and Delivery Problem.- Improved Sourcewise Roundtrip Spanners with Constant Stretch.- Randomized Data Partitioning with Efficient Search, Retrieval and Privacy Preservation.- The k edge-vertex domination problem.- Resource-Adaptive Newton's Method for Distributed Learning.- DR-submodular Function Maximization with Adaptive Stepsize.- On the Routing Problems in Graphs with Ordered Forbidden Transitions.- DelayingDecisions and Reservation Costs.- A PTAS Framework for Clustering Problems in Doubling Metrics.- A Physical Zero-knowledge Proof for Sumplete, a Puzzle Generated by Chat GPT.