Approximating Bounded Occurrence Ordering CSPs
暂无分享,去创建一个
[1] Madhu Sudan,et al. A Geometric Approach to Betweenness , 1995, ESA.
[2] Luca Trevisan,et al. Non-approximability results for optimization problems on bounded degree instances , 2001, STOC '01.
[3] 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.
[4] Johan Håstad,et al. On bounded occurrence constraint satisfaction , 2000, Inf. Process. Lett..
[5] Manuel Bodirsky,et al. The complexity of temporal constraint satisfaction problems , 2008, STOC.
[6] Walter Guttmann,et al. Variations on an Ordering Theme with Constraints , 2006, IFIP TCS.
[7] Prasad Raghavendra,et al. Optimal algorithms and inapproximability results for every CSP? , 2008, STOC.
[8] Venkatesan Guruswami,et al. Every Permutation CSP of arity 3 is Approximation Resistant , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.
[9] Elchanan Mossel,et al. Approximation Resistant Predicates from Pairwise Independence , 2008, Computational Complexity Conference.
[10] Prasad Raghavendra,et al. Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant , 2011, SIAM J. Comput..
[11] Bonnie Berger,et al. Tight Bounds for the Maximum Acyclic Subgraph Problem , 1997, J. Algorithms.
[12] Sunil Arya,et al. Space-time tradeoffs for approximate nearest neighbor searching , 2009, JACM.
[13] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[14] Yury Makarychev. Simple linear time approximation algorithm for betweenness , 2012, Oper. Res. Lett..
[15] Venkatesan Guruswami,et al. Is Constraint Satisfaction Over Two Variables Always Easy? , 2002, RANDOM.
[16] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[17] Johan Håstad. Every 2-CSP allows nontrivial approximation , 2005, STOC '05.