.- An Optimization Strategy for Fresh Agricultural Product Supply Chain with Altruistic Preference under Blockchain Technology. .- Approximation Algorithms for the Capacitated Min-Max and Minimum Graph Cover Problems. .- A Simple Algorithm for Scheduling Unit Jobs with Unknown Number of Machines. .- Faster Algorithms for Grid and Layered Drawings of Plane 3-Trees. .- Reinforcement Learning for Airline Continuous Dynamic Pricing. .- Approximation Algorithms for the Combination of Prize-Collecting Vertex Cover and Scheduling. .- Randomized Mechanisms for Improved Approximation Ratios in Heterogeneous Two-facility Location. .- Comprehensive Multi-view Subspace Clustering with Global-and-Local Representation Learning. .- On the Twin-width of Outerplanar Graphs. .- Maximize an approximate $k$-submodular function under a knapsack constraint. .- A Short Proof and Experimental Study of the Approximation Algorithm for Label s-t Cut. .- Risk-embedded Scheduling of a Virtual Power Plant with Electric Vehicle Parking Lot Considering Carbon Emission Trading. .- On the constrained Steiner strong connectivity augmentation problem. .- Competitive algorithms for online traveling salesman problem on a semi-line. .- On the inapproximability of two-machine open shop scheduling with exact delays. .- Minimum Power Partial Cover with Fairness Constraint. .- Differentially Private Counting Queries on Approximate Shortest Paths. .- Semi-online multiprocessor scheduling with known largest job processing time. .- Acyclically edge color triangle-free toroidal graphs in $\Delta + 2$ colors. .- An Equally-Split Bin Packing Problem. .- The location-routing problem in the pallet pooling system considering carbon emissions. .- Scheduling Fully Parallel Jobs with Integer Units. .- UAV Target Tracking with Bandit-Based Data Fusion. .- Fair Maximization of Monotone Submodular Functions in Data Streams. .- Tournament transitivity of graphs. .- Approximation algorithm for min-max correlation clustering problem with penalties. .- Improved Approximation Algorithm for Individual Fairness k-median. .- The Price of Fairness for Budget-Feasible EF1 Allocations. .- On the min-max heterogeneous weighted delivery problem. .- Exact and Approximate Heuristics for the Multi-Modal Stable Matching with Applications in Industry Chains. .- Budget feasible mechanism for a k-submodular function in the clock auction model. .- Kernel for Proper Helly Circular-arc Vertex Deletion: Smaller and Simpler via Graph Isomorphism. .- Approximately Non-k-submodular Maximization under p-System and l Knapsack Constraints. .- Alternating Lagrangian decomposition combining with branch and pricing for robust and integrated airline aircraft routing and crew pairing. .- A Comparative Analysis of NFT-Based Insurance Claim Management Systems Across EVM-Compatible Blockchain Platforms. .- Attaining Equilibria Using Control Sets. .- Scheduling on parallel-batch machines with rejection and resource matching. .- Some Combinatorial Algorithms on the Independent Number of k-Regular Connected Hyper graphs. .- Approximation Algorithms on k-Correlation Clustering of Uniform Hypergraphs.

GPSR Compliance The European Union's (EU) General Product Safety Regulation (GPSR) is a set of rules that requires consumer products to be safe and our obligations to ensure this. If you have any concerns about our products you can contact us on ProductSafety@springernature.com. In case Publisher is established outside the EU, the EU authorized representative is: Springer Nature Customer Service Center GmbH Europaplatz 3 69115 Heidelberg, Germany ProductSafety@springernature.com