Titlebook: Combinatorial Optimization and Applications; 14th International C Weili Wu,Zhongnan Zhang Conference proceedings 2020 Springer Nature Switz

LAY

adhesive

拖債

Approximate Ridesharing of Personal Vehicles Problem all trips have the same earliest departure and same latest arrival time. It is known that both minimization problems are NP-hard if one of Conditions (1), (2) and (3) is not satisfied. We prove that both problems are NP-hard and further show that it is NP-hard to approximate both problems within a

Infinitesimal

Selecting Sources for Query Approximation with Bounded Resourcesalgorithms to solve the problems and devise a bitwise operation strategy to improve efficiency, along with rigorous theoretical guarantees on their performance. Experimental results on both real-world and synthetic data show high efficiency and scalability of our algorithms.

母豬

Reachability Games for Optimal Multi-agent Scheduling of Tasks with Variable Durationsing optimal schedules for astronauts aboard the International Space Station. Finally, experiments on randomly generated instances show that, on average, this technique is at least two orders of magnitude faster than an integer program formulation.

SCORE

GLUT

Two-Stage Pricing Strategy with Price Discount in Online Social Networksa pricing model named Two-stage Pricing with Discount Model (TPDM). We propose that companies use two marketing methods: Advertisement Marketing (AM) and Word-of-mouth Marketing (WM). To achieve the goal of maximizing the profit of product companies, we propose a Two-stage with Discount Greedy Algor

ALIAS

Almost Linear Time Algorithms for Minsum ,-Sink Problems on Dynamic Flow Path Networkst all the people at a vertex have to evacuate to the same sink, and in the latter model, there is no such restriction. In this paper, for both the models, we develop algorithms which run in almost linear time regardless of the number of sinks. It should be stressed that for the confluent flow model,

的染料

Matched Participants Maximization Based on Social Spreadrd and the computation of the target function is #P-hard, under both the NM and GM strategies. To solve MPM-NM efficiently, we propose a Matching Reachable Set method and a .-approximation algorithm. Sandwich method is used for solving MPM-GM by using the result of MPM-NM as a lower-bound and constr

擴(kuò)張