Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph
暂无分享,去创建一个
[1] Sanjeev Khanna,et al. Streaming Lower Bounds for Approximating MAX-CUT , 2014, SODA.
[2] Uri Zwick,et al. Combinatorial approximation algorithms for the maximum directed cut problem , 2001, SODA '01.
[3] Venkatesan Guruswami,et al. Towards a Characterization of Approximation Resistance for Symmetric CSPs , 2017, Theory Comput..
[4] Johan Håstad. Every 2-CSP allows nontrivial approximation , 2005, STOC '05.
[5] Stanislav Zivny,et al. The Complexity of Finite-Valued CSPs , 2016, J. ACM.
[6] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[7] Alantha Newman,et al. Approximating the Maximum Acyclic Subgraph , 2000 .
[8] Luca Trevisan. Parallel Approximation Algorithms by Positive Linear Programming , 1998, Algorithmica.
[9] Nikhil Srivastava,et al. Graph Sparsification by Effective Resistances , 2011, SIAM J. Comput..
[10] Sanjeev Khanna,et al. (1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear Space , 2017, SODA.
[11] Prasad Raghavendra,et al. Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[12] Venkatesan Guruswami,et al. Tight bounds on the approximability of almost-satisfiable Horn SAT and exact hitting set , 2011, SODA '11.
[13] Wei Yu,et al. The streaming complexity of cycle counting, sorting by reversals, and other problems , 2011, SODA '11.