May 10, 2011 · We study the Minimum Submodular-Cost Allocation problem (MSCA). In this problem we are given a finite ground set V and k non-negative submodular set functions.

We study the Minimum Submodular-Cost Allocation problem (MSCA). In this problem we are given a finite ground set V and k non-negative submodular set ...

Submodular Cost Allocation Problem and Applications · C. Chekuri, Alina Ene · Published in International Colloquium on… 10 May 2011 · Computer Science, ...

Submodular cost allocation problem and applications. In Proc. of. ICALP, pages 354–366, 2011. 4. G. Călinescu, H. J. Karloff, and Y. Rabani. Approximation ...

Aug 13, 2018 · Chandra Chekuri, Alina Ene: Submodular Cost Allocation Problem and Applications. CoRR abs/1105.2040 (2011).

submodular function minimization problem on certain sets can be solved in oracle-polynomial time. In the following, we recall these results since they will ...

Workshop Theme: Submodular functions are discrete analogues of convex functions, arising in various fields of computer science and operations research.

Abstract We consider the following two deterministic inventory optimization prob- lems with non-stationary demands. Submodular joint replenishment problem.

Submodularity1 is a property of set functions with deep theoretical consequences and far– reaching applications. At first glance it appears very similar to ...

Submodular cost allocation problem and applications. In International Colloquium on Automata, Languages, and Programming, pages 354–366. Springer, 2011 ...