Buch, Englisch, Band 17244, Format (B × H): 155 mm x 235 mm
19th International Conference, COCOA 2026, Beijing, China, December 4–6, 2026, Proceedings
Buch, Englisch, Band 17244, Format (B × H): 155 mm x 235 mm
Reihe: Lecture Notes in Computer Science
ISBN: 978-981-9286-66-9
Verlag: Springer Singapore
The volume constitutes the conference proceedings of the 19th International Conference on Combinatorial Optimization and Applications, COCOA 2026, held in Beijing, China, during December 4–6, 2026.
The 48 full papers included in these volumes were carefully reviewed and selected from 161 submissions.
Zielgruppe
Research
Autoren/Hrsg.
Weitere Infos & Material
.- Optimization in Graphs.
.- Approximations for the Min-Max Balanced Spanning 2-Forest Problem.
.- On the Complexity of Hop Domination and 2-Step Domination in
Graph Classes.
.- Broadcast Domination Number is at Most Twice the Multipacking Number.
.- Improved Approximation Algorithms for the Maximum Weight.
.- Dominating broadcast in d-dimensional space.
.- Strong Edge Colouring of Disk Graphs: A 6-Approximation and an
Improved Unit-Disk Bound.
.- Boundary-State Compression Dynamic Programming Algorithms for
Weighted Multiple Domination Problems on Interval Graphs.
.- Maximum Matching-Match: Hardness and Approximation.
.- An Improved Upper Bound for the Turán Number of the Hexagon.
.- Locating Hop and Locating 2-Step Domination in Some Graph Classes.
.- Facility Location and Clustering.
.- Prize-Collecting k-Sink on Dynamic Path Networks.
.- Approximation Algorithms and Lower Bounds for Facility Location
with Opening Costs and Maximum Service Distance.
.- A Parameterized Approximation Algorithm for k-Center Clustering
with Minimum Representation Fairness.
.- Beyond Max and Sum: Compatibility of Two-Level Centrum Objectives.
.- An Improved Distributed Algorithm for k-Center with Outliers.
.- A Combinatorial Approximation Algorithm for Fault-Tolerant Facility
Location with Heterogeneous Demands.
.- Exact and Scalable Continuous k-Center for fixed k.
.- Path Planning.
.- Approximating the Rural Postman Problem below 3/2.
.- Continuous Map Matching to Graphs under Travel Time Constraints.
.- On the Vertex-Traversing-Constrained Windy Postman Problem.
.- 5/3-Approximation Algorithms for the Ordered Clustered Rural
Postman Problem.
.- A Recursive Preprocessing for Routing among Convex Polygonal Obstacles.
.- Approximate Shortest Path Queries amid Convex Polygonal Obstacles.
.- Scheduling and Resource Management.
.- On Randomized Online Span Minimization.
.- Learning-augmented Multi-objective Resource Allocation for International Dry Port Management Using Public Operational Data.
.- On the Generalized 2-Assignment Problems.
.- Hardness of the parallel two-stage flowshops under makespan constraint.
.- Single-Machine Scheduling with Penalty and Learning Effects under
Fair Constraints.
.- TCN-Transformer-LSTM: Multiscale temporal feature learning for
short-term water demand forecasting in district metered areas.
.- Submodular and Covering Optimization.
.- Projected Gradient Methods for Maximizing Sums of DR-Submodular
and Concave Functions.
.- Approximation-Query Tradeoffs for Decomposed Weak-DR
Maximization under a Matroid.
.- Curvature-Aware GSEMO for Budgeted Sequence Submodular
Maximization.
.- Approximation Algorithms for Roman Hitting Set.
.- Approximation algorithms for the bisubmodular load balancing.
.- Differentially Private Partial-Monotone Adaptive Submodular
Maximization under k-System Constraints.
.- Network Optimization and Secure Computation.
.- Temporal Replica Propagation with Tree-Convex Service Regions.
.- Efficient Card-Based Multiplication Protocols for the Integer Encoding.
.- APX-Hardness of Quickest Flows with Davidson-Type Transit Times.
.- Bicriteria Approximation for Arc-Disjoint Routing with a Shared-Vertex
Budget.
.- Blends of Solutions and Their Efficiency.
.- Convex Risk Allocation for Finite-Agent Markov Control with Capacity
Constraints.
.- The Optimal Diversity Management Problem under Budgeted Demand
Uncertainty.
.- Pricing of Electric Vehicle Charging with Fairness-Oriented Incentives:
A Potential Game Framework.
.- Robotic and Mobile Systems Optimization.
.- Rolling-Horizon Route Set Packing for Risk-Aware Multi-Charger
Scheduling in Wireless Rechargeable Sensor Networks.
.- A Bicriteria Approximation Algorithm of Min-Max UAV Flight Time
in Data Collection.
.- DiffuMARL-BSTO: A Hierarchical Diffusion-MARL Framework for
Robotic Beam Selection and Trajectory Optimization.
.- Forecast-Guided Courier Repositioning for Online Meal Delivery.
.- Robust Submodular Multiple-Path Orienteering Problem for Heterogeneous Robots under Budgeted Attacks.
