No. Title Author Year
1 Separating the NP-Hardness of the Grothendieck Problem from the Little-Grothendieck Problem Bhattiprolu, Vijay et al. 2022
2 A Constant-Factor Approximation for Weighted Bond Cover Kim, Eun Jung et al. 2021
3 Towards Constant-Factor Approximation for Chordal / Distance-Hereditary Vertex Deletion Ahn, Jungho et al. 2020
4 Improved 3LIN Hardness via Linear Label Cover Harsha, Prahladh et al. 2019
5 Tight FPT Approximations for k-Median and k-Means Cohen-Addad, Vincent et al. 2019
6 Optimal Online Contention Resolution Schemes via Ex-Ante Prophet Inequalities Lee, Euiwoong et al. 2018
7 Understanding the Correlation Gap For Matchings Guruganesh, Guru et al. 2018
8 Global and Fixed-Terminal Cuts in Digraphs Bérczi, Kristóf et al. 2017
9 Improved Hardness for Cut, Interdiction, and Firefighter Problems Lee, Euiwoong 2017
10 Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere Bhattiprolu, Vijay et al. 2017
11 Approximate Hypergraph Coloring under Low-discrepancy and Related Promises Bhattiprolu, Vijay V. S. P. et al. 2015
12 Inapproximability of H-Transversal/Packing Guruswami, Venkatesan et al. 2015
13 Towards a Characterization of Approximation Resistance for Symmetric CSPs Guruswami, Venkatesan et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 13


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI