Titlebook: Algorithmic Aspects in Information and Management; 14th International C Zhao Zhang,Wei Li,Ding-Zhu Du Conference proceedings 2020 Springer

Insatiable

Adaptive Robust Submodular Optimization and Beyond,icular, our algorithm achieves approximation ratio . when considering a single matroid constraint. At last, we present two heuristics for the general case with nearly submodular functions. All proposed solutions are non-adaptive which are easy to implement.

HUSH

https://doi.org/10.1007/978-3-476-02749-8l time in . to solve integer linear programming problem with . be the total number of input linear inequalities. We develop algorithms to count the number of lattice points in geometric region determined by a polyhedral circuit in . time and to compute the volume of geometric region determined by a

CON

https://doi.org/10.1007/978-3-642-75324-4r tree (CMRST) problem..We obtain three main results as follows. (1) We design an exact algorithm in time . to solve the CMRST problem; (2) We show that the same algorithm in (1) is a 1.5-approximation algorithm to solve the 1LF-MRST problem; (3) Using a combination of the algorithm in (1) for many

Anemia

Aufbereitung und Auswertung der Daten,get allocation problem is monotone and DR-submodular, then a greedy algorithm is devised to get a . approximation ratio; then we solve the Protector Seed Selection (PSS) problem in the second stage after we obtained the budget allocation vector for communities, we greedily choose protectors for each

擁護(hù)者