Author:
Du Ding-Zhu,Pardalos Panos,Hu Xiaodong,Wu Weili
Publisher
Springer International Publishing
Reference26 articles.
1. A.A. Ageev and M. Svirdenko: Pipage rounding: a new method of constructing algorithms with proven performance guarantee, Journal of Combinatorial Optimization, 8: 307–328 (2004).
2. M. Bellare, O. Goldreich and M. Sudan: Free bits and nonapproximability, Proceedings, 36th FOCS, pp.422–431, 1995.
3. Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra: On dependent randomized rounding algorithms, Oper. Res. Lett. 24(3): 105–114 (1999).
4. Gruia Calinescu, Chandra Chekuri, Martin Pai, Jan Vondrak: Maximizing a submodular set function subject to a matroid constraint, Proceedings, IPCO, pp. 182–196, 2007.
5. Jing-Chao Chen: Iterative rounding for the closest string problem, CoRR abs/0705.0561: (2007).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献