A factor approximation algorithm for two-stage stochastic matching problems

2006 ◽  
Vol 172 (3) ◽  
pp. 740-746 ◽  
Author(s):  
Nan Kong ◽  
Andrew J. Schaefer
2008 ◽  
Vol 408 (2-3) ◽  
pp. 213-223 ◽  
Author(s):  
Irit Katriel ◽  
Claire Kenyon-Mathieu ◽  
Eli Upfal

Author(s):  
Zhicheng Liu ◽  
Hong Chang ◽  
Ran Ma ◽  
Donglei Du ◽  
Xiaoyan Zhang

Abstract We consider a two-stage submodular maximization problem subject to a cardinality constraint and k matroid constraints, where the objective function is the expected difference of a nonnegative monotone submodular function and a nonnegative monotone modular function. We give two bi-factor approximation algorithms for this problem. The first is a deterministic $\left( {{1 \over {k + 1}}\left( {1 - {1 \over {{e^{k + 1}}}}} \right),1} \right)$ -approximation algorithm, and the second is a randomized $\left( {{1 \over {k + 1}}\left( {1 - {1 \over {{e^{k + 1}}}}} \right) - \varepsilon ,1} \right)$ -approximation algorithm with improved time efficiency.


2010 ◽  
Vol 205 (1) ◽  
pp. 19-30 ◽  
Author(s):  
Bruno Escoffier ◽  
Laurent Gourvès ◽  
Jérôme Monnot ◽  
Olivier Spanjaard

2015 ◽  
Vol 115 (4) ◽  
pp. 475-480 ◽  
Author(s):  
Jianming Dong ◽  
Yiwei Jiang ◽  
An Zhang ◽  
Jueliang Hu ◽  
Hui Luo

2019 ◽  
Vol 38 (2) ◽  
pp. 618-634 ◽  
Author(s):  
Jin Zhang ◽  
Min Li ◽  
Yishui Wang ◽  
Chenchen Wu ◽  
Dachuan Xu

Sign in / Sign up

Export Citation Format

Share Document