Author:
Aurora Pawan,Tiwary Hans Raj
Publisher
Springer International Publishing
Reference33 articles.
1. Aurora, P., Mehta, S.K.: The QAP-polytope and the graph isomorphism problem. J. Comb. Optim. 36(3), 965–1006 (2018)
2. Aurora, P., Tiwary, H.R.: On the complexity of some facet-defining inequalities of the QAP-polytope. CoRR abs/2010.06401 (2020)
3. Avis, D., Tiwary, H.R.: On the extension complexity of combinatorial polytopes. Math. Program. 153(1), 95–115 (2014). https://doi.org/10.1007/s10107-014-0764-2
4. Bazzi, A., Fiorini, S., Pokutta, S., Svensson, O.: No small linear program approximates vertex cover within a factor 2 - $$\varepsilon $$. Math. Oper. Res. 44(1), 147–172 (2019)
5. Braun, G., Fiorini, S., Pokutta, S., Steurer, D.: Approximation limits of linear programs (beyond hierarchies). Math. Oper. Res. 40(3), 756–772 (2015)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献