Publisher
Springer International Publishing
Reference14 articles.
1. Lecture Notes in Computer Science;T Carnes,2008
2. Carr, R.D., Fleischer, L., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: SODA, pp. 106–115 (2000)
3. Dilworth, R.P.: A decomposition theorem for partially ordered sets. In: Gessel, I., Rota, G.C. (eds.) Classic Papers in Combinatorics, pp. 139–144. Springer, Heidelberg (2009). https://doi.org/10.1007/978-0-8176-4842-8_10
4. Dinur, I., Guruswami, V., Khot, S., Regev, O.: A new multilayered PCP and the hardness of hypergraph vertex cover. SIAM J. Comput. 34(5), 1129–1146 (2005). https://doi.org/10.1137/S0097539704443057
5. Espinoza, D., Goycoolea, M., Moreno, E.: The precedence constrained knapsack problem: Separating maximally violated inequalities. Disc. Appl. Math. 194, 65–80 (2015). https://doi.org/10.1016/j.dam.2015.05.020
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献