Xian Qiu

Learn More
We consider the uncapacitated facility location problem with (linear) penalty function and show that a modified JMS algorithm, combined with a randomized LP rounding technique due to Byrka-Aardal [1], Li [14] and Li et al. [16] yields 1.488 approximation, improving the factor 1.5148 due to Li et al. [16]. This closes the current gap between the classical(More)
a r t i c l e i n f o a b s t r a c t We study the Stackelberg/bilevel knapsack problem as proposed by Chen and Zhang [1]: Consider two agents, a leader and a follower. Each has his own knapsack. (Knapsack capacities are possibly different.) As usual, there is a set of items i = 1,. .. , n of given weights w i and profits p i. It is allowed to pack item i(More)
The bin packing game is a cooperative-person game, where the set of players consists of bins, each has capacity 1 and items of sizes 1 , 2 , ⋅ ⋅ ⋅ , , w.l.o.g, we assume 0 ≤ ≤ 1 for all 1 ≤ ≤. The value function of a coalition of bins and items is the maximum total size of items in the coalition that can be packed into the bins of the coalition. A typical(More)
  • 1