LEADER 06078nam 22007095 450 001 9910770270403321 005 20240627180943.0 010 $a3-031-49611-6 024 7 $a10.1007/978-3-031-49611-0 035 $a(MiAaPQ)EBC31009084 035 $a(Au-PeEL)EBL31009084 035 $a(DE-He213)978-3-031-49611-0 035 $a(CKB)29337975700041 035 $a(EXLCZ)9929337975700041 100 $a20231208d2024 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aCombinatorial Optimization and Applications $e16th International Conference, COCOA 2023, Hawaii, HI, USA, December 15?17, 2023, Proceedings, Part I /$fedited by Weili Wu, Jianxiong Guo 205 $a1st ed. 2024. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2024. 215 $a1 online resource (535 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v14461 311 08$aPrint version: Wu, Weili Combinatorial Optimization and Applications Cham : Springer,c2024 9783031496103 320 $aIncludes bibliographical references and index. 327 $aOptimization in Graphs -- An Efficient Local Search Algorithm for Correlation Clustering on Large Graphs -- Algorithms on a path covering problem with applications in transportation -- Faster Algorithms for Evacuation Problems in Networks with a Single Sink of Small Degree and Bounded Capacitated Edges -- An O(log n)-Competitive Posted-Price Algorithm for Online Matching on the Line -- Online Dominating Set and Coloring -- Near-Bipartiteness, Connected Near-Bipartiteness, Independent Feedback Vertex Set and Acyclic Vertex Cover on graphs having small dominating sets -- Exactly k MSTs: How many vertices suffice? -- Minimum Monotone Tree Decomposition of Density Functions Defined on Graphs -- Scheduling -- Exact and Approximation Algorithms for the Multi-depot Data Mule Scheduling with Handling Time and Time Span Constraints -- Two Exact Algorithms for the Packet Scheduling Problem -- Improved Scheduling with a Shared Resource -- An Energy-efficient Scheduling Method for Real-time Multi-workflow in Container Cloud -- Set-Related Optimization -- Weakly Nondominated Solutions of Set-Valued Optimization Problems with Variable Ordering Structures in Linear Spaces -- The MaxIS-Shapley Value in Perfect Graphs -- Asteroidal Sets and Dominating Paths -- A Novel Approximation Algorithm for Max-Covering Circle Problem -- GAMA: Genetic algorithm for k-coverage and connectivity with minimum sensor activation in wireless sensor networks -- Simple Heuristics for the Rooted Max Tree Coverage Problem -- Efficient Algorithms for k-Submodular Maximization with the p-system and d-knapsack Constraints -- Data Summarization beyond Monotonicity: Non-monotone Two-Stage Submodular Maximization -- Greedy+Max: An Efficient Approximation Algorithm for $k$-Submodular Knapsack Maximization -- Applied Optimization and Algorithm -- Improved Lower Bound for Estimating the Number of Defective Items -- Popularity on the Roommate Diversity Problem -- On Half Guarding Polygons -- Dynamic Programming for the Fixed Route Hybrid Electric Aircraft Charging Problem -- Algorithms for the Ridesharing with Profit Constraint Problem -- Multi-Candidate Carpooling Routing Problem and Its Approximation Algorithms -- Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-like Graphs -- The Line-constrained Maximum Coverage Facility Location Problem -- Graph Planer and Others -- On Connectedness of Solutions to Integer Linear Systems -- An exact algorithm for the line-constrained bottleneck $k$-Steiner tree problem -- The Longest Subsequence-Repeated Subsequence Problem -- An Approximation Algorithm for Covering Vertices by 4^+-Paths -- V-Words, Lyndon Words and Substring circ-UMFFs -- The Two-Center Problem of Uncertain Points on Trees -- Space-Time Graph Planner for Unsignalized Intersections with CAVs -- The Two Sheriffs Problem: Cryptographic Formalization and Generalization. 330 $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. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v14461 606 $aComputer science 606 $aData structures (Computer science) 606 $aInformation theory 606 $aComputer science$xMathematics 606 $aArtificial intelligence 606 $aComputer graphics 606 $aTheory of Computation 606 $aData Structures and Information Theory 606 $aMathematics of Computing 606 $aArtificial Intelligence 606 $aComputer Graphics 615 0$aComputer science. 615 0$aData structures (Computer science) 615 0$aInformation theory. 615 0$aComputer science$xMathematics. 615 0$aArtificial intelligence. 615 0$aComputer graphics. 615 14$aTheory of Computation. 615 24$aData Structures and Information Theory. 615 24$aMathematics of Computing. 615 24$aArtificial Intelligence. 615 24$aComputer Graphics. 676 $a519.64 702 $aWu$b Weili 702 $aGuo$b Jianxiong 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910770270403321 996 $aCombinatorial Optimization and Applications$9772251 997 $aUNINA