000 06013nam a22006135i 4500
001 978-3-031-49611-0
003 DE-He213
005 20240730170706.0
007 cr nn 008mamaa
008 231208s2024 sz | s |||| 0|eng d
020 _a9783031496110
_9978-3-031-49611-0
024 7 _a10.1007/978-3-031-49611-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 _aCombinatorial Optimization and Applications
_h[electronic resource] :
_b16th International Conference, COCOA 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part I /
_cedited by Weili Wu, Jianxiong Guo.
250 _a1st ed. 2024.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2024.
300 _aXVIII, 527 p. 127 illus., 67 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 ;
_v14461
505 0 _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.
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.
_99832
650 0 _aData structures (Computer science).
_98188
650 0 _aInformation theory.
_914256
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aArtificial intelligence.
_93407
650 0 _aComputer graphics.
_94088
650 1 4 _aTheory of Computation.
_994860
650 2 4 _aData Structures and Information Theory.
_931923
650 2 4 _aMathematics of Computing.
_931875
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aComputer Graphics.
_94088
700 1 _aWu, Weili.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_994863
700 1 _aGuo, Jianxiong.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_994864
710 2 _aSpringerLink (Online service)
_994865
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031496103
776 0 8 _iPrinted edition:
_z9783031496127
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14461
_923263
856 4 0 _uhttps://doi.org/10.1007/978-3-031-49611-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cEBK
999 _c87115
_d87115