Titlebook: Combinatorial Optimization and Applications; 8th International Co Zhao Zhang,Lidong Wu,Ding-Zhu Du Conference proceedings 2014 Springer Int

GLARE

indignant

Combinatorial Optimization and Applications978-3-319-12691-3Series ISSN 0302-9743 Series E-ISSN 1611-3349

AVOW

Hassan Abdirahman Farah,Arzu Gorgulu Kakisimin a bin of capacity . upon its arrival without any information on the next items, and the goal is to minimize the number of used bins. We present an asymptotic competitive scheme, i.e., for any ., the asymptotic competitive ratio is at most ., where . is the smallest possible asymptotic competitive ratio among all online algorithms.

Humble

Changqing Ji,Yang Gao,Zumin Wang,Jing Qin achieve a bounded ratio of evacuation path length without any boundary information to that with. We restrict the affected area to a convex region in the plane, and present a 19.64-competitive strategy. It can be considered as the planar generalization of the .. Also, we give a 21-competitive strategy in the grid network.

sundowning

machination

On-Line Strategies for Evacuating from a Convex Region in the Plane achieve a bounded ratio of evacuation path length without any boundary information to that with. We restrict the affected area to a convex region in the plane, and present a 19.64-competitive strategy. It can be considered as the planar generalization of the .. Also, we give a 21-competitive strategy in the grid network.

ureter

convulsion

啜泣

vanquish

Randomized Online Algorithms for Set Cover Leasing Problemsline Set Cover with Repetitions presented by Alon et al. [.], where elements appear multiple times and must be covered by a different set at each arrival. Our results improve the . competitive factor of Online Set Cover with Repetitions [.] to ., where . is the maximum number of sets an element belongs to.