Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Arora, S., Frieze, A., Kaplan, H.: A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Math. Program. 92, 1–36 (2002)
2. Asano, T., Katoh, N., Obokata, K., Tokuyama, T.: Matrix rounding under the
$L\sb p$
-discrepancy measure and its application to digital halftoning. SIAM J. Comput. 32, 1423–1435 (2003)
3. Ageev, A.A., Sviridenko, M.I.: Pipage rounding: a new method of constructing algorithms with proven performance guarantee. J. Comb. Optim. 8, 307–328 (2004)
4. Beck, J., Spencer, J.: Integral approximation sequences. Math. Programming 30, 88–98 (1984)
5. Doerr, B.: Non-independent randomized rounding. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 506–507 (2003)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献