APPROX 2006 | Sciweavers

18

APPROX
2006
Springer

126views Algorithms» more APPROX 2006»

Better Approximations for the Minimum Common Integer Partition Problem

13 years 11 months ago

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

claim paper

Read More »

19

click to vote

APPROX
2006
Springer

114views Algorithms» more APPROX 2006»

Stochastic Combinatorial Optimization with Controllable Risk Aversion Level

13 years 11 months ago

Download www.stanford.edu

Anthony Man-Cho So, Jiawei Zhang, Yinyu Ye

claim paper

Read More »

23

click to vote

APPROX
2006
Springer

126views Algorithms» more APPROX 2006»

Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems

13 years 11 months ago

Download www.openu.ac.il

Zeev Nutov

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers