000 05252nam a22006495i 4500
001 978-3-031-49190-0
003 DE-He213
005 20240423130235.0
007 cr nn 008mamaa
008 231208s2024 sz | s |||| 0|eng d
020 _a9783031491900
_9978-3-031-49190-0
024 7 _a10.1007/978-3-031-49190-0
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aComputing and Combinatorics
_h[electronic resource] :
_b29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I /
_cedited by Weili Wu, Guangmo Tong.
250 _a1st ed. 2024.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2024.
300 _aXVII, 413 p. 60 illus., 30 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14422
505 0 _aCombinatorics 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.
520 _aThis two volume set 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.
650 0 _aComputer science.
650 0 _aImage processing
_xDigital techniques.
650 0 _aComputer vision.
650 0 _aData structures (Computer science).
650 0 _aInformation theory.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aNumerical analysis.
650 1 4 _aTheory of Computation.
650 2 4 _aComputer Imaging, Vision, Pattern Recognition and Graphics.
650 2 4 _aData Structures and Information Theory.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aSymbolic and Algebraic Manipulation.
650 2 4 _aNumerical Analysis.
700 1 _aWu, Weili.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aTong, Guangmo.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031491894
776 0 8 _iPrinted edition:
_z9783031491917
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14422
856 4 0 _uhttps://doi.org/10.1007/978-3-031-49190-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c186527
_d186527