Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Reference24 articles.
1. Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169–197 (1981)
2. Iwata, S., Fleischer, L., Fujishige, S.: A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48(4), 761–777 (2001)
3. Ageev, A.A., Sviridenko, M.I.: An 0.828-approximation algorithm for the uncapacitated facility location problem. Discrete Appl. Math. 93(2–3), 149–156 (1999)
4. Anstreicher, K.M., Lee, J.: A Masked Spectral Bound For Maximum-entropy Sampling. mODa 7-Advances in Model-Oriented Design and Analysis. Physica, Heidelberg, pp. 1–12 (2004)
5. Feige, U., Goemans, M.: Approximating the value of two prover proof systems, with applications to max 2sat and max dicut. In: Proceedings of 3th Israel Symposium on Theory of Computing and Systems, pp. 182–189 (1995)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献