Sciweavers

APPROX
2006
Springer
126views Algorithms» more  APPROX 2006»
15 years 16 days ago
Better Approximations for the Minimum Common Integer Partition Problem
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
David P. Woodruff
APPROX
2006
Springer
114views Algorithms» more  APPROX 2006»
15 years 16 days ago
Stochastic Combinatorial Optimization with Controllable Risk Aversion Level
Anthony Man-Cho So, Jiawei Zhang, Yinyu Ye