Computing and Combinatorics: 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I

Author:   Weili Wu ,  Guangmo Tong
Publisher:   Springer International Publishing AG
Edition:   1st ed. 2024
Volume:   14422
ISBN:  

9783031491894


Pages:   413
Publication Date:   09 December 2023
Format:   Paperback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $168.16 Quantity:  
Add to Cart

Share |

Computing and Combinatorics: 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I


Add your own review!

Overview

Full Product Details

Author:   Weili Wu ,  Guangmo Tong
Publisher:   Springer International Publishing AG
Imprint:   Springer International Publishing AG
Edition:   1st ed. 2024
Volume:   14422
Weight:   0.658kg
ISBN:  

9783031491894


ISBN 10:   3031491890
Pages:   413
Publication Date:   09 December 2023
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

Combinatorics and Algorithms.- Quantum Query Lower Bounds for Key Recovery Attacks on the Even-Mansour Cipher.- Extended formulations via decision diagrams.- Greedy Gray codes for Dyck words and ballot sequences.- Efficiently-Verifiable Strong Uniquely Solvable Puzzles and Matrix Multiplication.- (min,+) Matrix and Vector Products for Inputs Decomposable into Few Monotone Subsequences.- A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons.- An Approach to Agent Path Planning under Temporal Logic Constraints.- The Heterogeneous Rooted Tree Cover Problem.- The Hardness of Optimization Problems on the Weighted Massively Parallel Computation Model.- The Regularized Submodular Maximization via the Lyapunov Method.- Topological network-control games.- Lower Bounds of Functions on Finite Abelian Groups.- A Discharging Method: Improved Kernels for Edge Triangle Packing and Covering.- Random Shortening of Linear Codes and Applications.- Algorithms for Full-View Coverage of Targets with Group Set Cover.- Improved bounds for the binary paint shop problem.- Algorithmic Solution in Applications.- Fitch Graph Completion.- Deterministic Primal-Dual Algorithms for Online k-way Matching with Delays.- Diversity and freshness-aware regret minimizing set queries.- A Modified EXP3 in Adversarial Bandits with Multi-User Delayed Feedback.- Cabbage Can’t Always be Transformed into Turnip: Decision Algorithms for Sorting by Symmetric Reversals.- k-median/means with outliers revisited: a simple fpt approximation.- A cost-sharing scheme for the $k$-product facility location game with penalties.- Algorithm in Networks.- Maximizing Diversity and Persuasiveness of Opinion Articles in Social Networks.- Stochastic Model for Rumor Blocking Problem in Social Networks under Rumor Source Uncertainty.- Algorithms for Shortest Path Tour Problem in Large-Scale Road Network.- Solving systems of linear equations through zero forcing sets.- Profit Maximization for Competitive Influence Spread in Social Networks.- Improved Approximation Algorithms for Multidepot Capacitated Vehicle Routing.- On the Minimum Depth of Circuits with Linear Number of Wires Encoding Good Codes.- Approval-Based Participatory Budgeting with Donations.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

wl

Shopping Cart
Your cart is empty
Shopping cart
Mailing List