论文信息 - Polynomial Constraint Satisfaction: A Framework for Counting and Sampling CSPs and Other Problems - 字舞流文

Polynomial Constraint Satisfaction: A Framework for Counting and Sampling CSPs and Other Problems

Alex D. Scott | Gregory B. Sorkin

[1] Alex D. Scott,et al. An LP-Designed Algorithm for Constraint Satisfaction , 2006, ESA.

[2] Alex D. Scott,et al. Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances , 2003, RANDOM-APPROX.

[3] Fedor V. Fomin,et al. Reports in Informatics , 2005 .

[4] Stefan Arnborg,et al. Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..

[5] Jaroslav Nesetril,et al. Graphs and homomorphisms , 2004, Oxford lecture series in mathematics and its applications.

[6] Martin E. Dyer,et al. On Counting Homomorphisms to Directed Acyclic Graphs , 2006, ICALP.

[7] Ryan Williams,et al. A new algorithm for optimal 2-constraint satisfaction and its implications , 2005, Theor. Comput. Sci..

[8] Rolf Niedermeier,et al. Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT , 2003, Discret. Appl. Math..

[9] Klaus Jansen,et al. Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs , 2005, SIAM J. Comput..

[10] Rina Dechter,et al. Tree Clustering for Constraint Networks , 1989, Artif. Intell..

[11] Rina Dechter,et al. Network-Based Heuristics for Constraint-Satisfaction Problems , 1987, Artif. Intell..