Books+ Search Results
Computing and Combinatorics 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part II
Title
Computing and Combinatorics [electronic resource] : 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part II / edited by Weili Wu, Guangmo Tong.
ISBN
9783031491931
Edition
1st ed. 2024.
Publication
Cham : Springer Nature Switzerland : Imprint: Springer, 2024.
Physical Description
1 online resource (XVII, 419 p.) 61 illus., 30 illus. in color.
Local Notes
Access is available to the Yale community.
Access and use
Access restricted by licensing agreement.
Summary
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.
Variant and related titles
Springer ENIN.
Other formats
Printed edition:
Printed edition:
Format
Books / Online
Language
English
Added to Catalog
January 17, 2024
Series
Lecture Notes in Computer Science, 14423
Contents
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
Delaying Decisions 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.
Subjects
Also listed under
Bookmark As
Citation
