000 05760nam a22006135i 4500
001 978-3-031-49614-1
003 DE-He213
005 20240423130235.0
007 cr nn 008mamaa
008 231208s2024 sz | s |||| 0|eng d
020 _a9783031496141
_9978-3-031-49614-1
024 7 _a10.1007/978-3-031-49614-1
_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 _aCombinatorial Optimization and Applications
_h[electronic resource] :
_b16th International Conference, COCOA 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part II /
_cedited by Weili Wu, Jianxiong Guo.
250 _a1st ed. 2024.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2024.
300 _aXVIII, 497 p. 119 illus., 71 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 ;
_v14462
505 0 _aModeling and Algorithms -- Differentiable Discrete Optimization using Dataless Neural Networks -- When Advertising meets Assortment Planning: Joint Advertising and Assortment Optimization under Multinomial Logit Model -- Twin-treewidth: A single-exponential logic-based approach -- Highway Preferential Attachment Models for Geographic Routing -- Complexity and Approximation -- Restricted Holant Dichotomy on Domains 3 and 4 -- Earliest Deadline First is a $2$-approximation for DARP with Time Windows -- Improved approximation for broadcasting in k-Path Graphs -- The fine-grained complexity of approximately counting proper connected colorings (extended abstract) -- Combinatorics and Computing -- Strong edge coloring of subquartic graphs -- Two multicolor Ramsey numbers involving bipartite graphs -- Mechanism Design for Time-Varying Value Tasks in High-Load Edge Computing Markets -- Computing random r-orthogonal Latin squares -- Optimization and Algorithms -- A Two-stage SeedsAlgorithm for Competitive Influence Maximization considering User Demand -- Practical Attribute-Based Multi-Keyword Search Scheme with Sensitive Information Hiding for Cloud Storage Systems -- Testing Higher-order Clusterability on graphs -- The $2$-mixed-center color spanning problem -- A Dynamic Parameter Adaptive Path Planning Algorithm -- On the Mating Between a Polygonal Curve and a Convex Polygon -- A Faster Parameterized Algorithm for Bipartite 1-Sided Vertex Explosion -- Multi-Winner Approval Voting with Grouped Voters -- EFX Allocation to Chores Over Small Graph -- Extreme Graph and Others -- Zero-visibility Cops and Robber game on Cage graph -- Online Facility Assignment for General Layout of Servers on a Line -- Guarding Precise and Imprecise Polyhedral Terrains with Segments -- The Bag-Based Search: A meta-algorithm to construct tractable logical circuits for graphs based on tree decomposition -- On Problems Related to Absent Subsequences -- Some Combinatorial Algorithms on the Dominating Number of Anti-Rank k Hypergraphs -- Parameterized and exact-exponential algorithms for the read-once integer refutation problem in UTVPI constraints -- Critical $(P_5,dart)$-Free Graphs -- Graph Clustering through Users' Properties and Social Influence -- Machine Learning, Blockchain and Others -- Incorporating Neural Point Process-based Temporal Feature for Rumor Detection -- Improving Contraction Hierarchies by Combining with All-Pairs Shortest Paths Problem Algorithms -- Information Theory of Blockchain Systems -- Machine Learning with Low Resource Data from Psychiatric Clinics -- Single Image Dehazing Based on Dynamic Convolution and Transformer -- Reinforcement Learning for Combating Cyberbullying in Online Social Networks.
520 _aThe two-volume set LNCS 14461 and LNCS 14462 constitutes the refereed proceedings of the 17th International Conference on Combinatorial Optimization and Applications, COCOA 2023, held in Hawaii, HI, USA, during December 15–17, 2023. The 73 full papers included in the proceedings were carefully reviewed and selected from 117 submissions. They were organized in topical sections as follows: Part I: Optimization in graphs; scheduling; set-related optimization; applied optimization and algorithm; Graph planer and others; Part II: Modeling and algorithms; complexity and approximation; combinatorics and computing; optimization and algorithms; extreme graph and others; machine learning, blockchain and others.
650 0 _aComputer science.
650 0 _aArtificial intelligence.
650 0 _aComputer science
_xMathematics.
650 0 _aData structures (Computer science).
650 0 _aInformation theory.
650 0 _aComputer graphics.
650 1 4 _aTheory of Computation.
650 2 4 _aArtificial Intelligence.
650 2 4 _aMathematics of Computing.
650 2 4 _aData Structures and Information Theory.
650 2 4 _aComputer Graphics.
700 1 _aWu, Weili.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aGuo, Jianxiong.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031496134
776 0 8 _iPrinted edition:
_z9783031496158
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14462
856 4 0 _uhttps://doi.org/10.1007/978-3-031-49614-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c186530
_d186530